„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Combinatorial pattern matching – 22nd annual symposium ; proceedings
  Giancarlo, Raffaele ; Manzini, Giovanni 2011 Springer
• State-Space Search – Algorithms, Complexity, Extensions, and Applications
  Zhang, Weixiong 1999 Springer New York
• State space search – algorithms, complexity, extensions, and applications
  Zhang, Weixiong 1999 Springer
• Approximation and online algorithms – 8th international workshop ; revised papers
  Jansen, Klaus ; Solis-Oba, Roberto 2011 Springer
• Parameterized and exact computation – 5th international symposium ; proceedings
  Raman, Venkatesh ; Saurabh, Saket 2010 Springer
• Advances in Artificial Intelligence – 18th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2005, Victoria, Canada, May 9-11, 2005. Proceedings
  Herrera, Francisco 2005 Springer Berlin Heidelberg
• Scheduling unrelated parallel machines – algorithms, complexity, and performance
  Wotzlaw, Andreas
• Comparative analysis of accuracy and computational complexity across 21 swarm intelligence algorithms
  Warnakulasooriya, Kolitha ; Segev, Aviv
• On the complexity of approximating tsp with neighborhoods and related problems
  Safra, Shmuel ; Schwartz, Oded
• Complexity Analysis of Regularization Methods for Implicitly Constrained Least Squares
  Onwunta, Akwum ; Royer, Clément W.
• Feature selection algorithm for usability engineering: a nature inspired approach
  Jain, Rajat ; Joseph, Tania ; Saxena, Anvita ; Gupta, Deepak ; Khanna, Ashish ; Sagar, Kalpna ; Ahlawat, Anil K.
• A Time-Critical Low Complexity Distributed Self Organizing Hierarchical Particle Swarm Optimization Algorithm for Wireless Sensor Networks
  Bin Saeed, Muhammad Omer ; Khan, Salman A. ; Butt, Naveed R. ; Mohammad, Nazeeruddin
• An Axiomatic Approach to Time-Dependent Shortest Path Oracles
  Kontogiannis, Spyros C. ; Wagner, Dorothea ; Zaroliagis, Christos
• Deterministic Leader Election Takes $$\Theta (D + \log n)$$ Θ(D+logn) Bit Rounds
  Casteigts, Arnaud ; Métivier, Y. ; Robson, J. M. ; Zemmari, A.
• Approximating the Generalized Minimum Manhattan Network Problem
  Das, Aparna ; Fleszar, Krzysztof ; Kobourov, Stephen ; Spoerhase, Joachim ; Veeramoni, Sankar ; Wolff, Alexander
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
  Guisewite, G. M. ; Pardalos, P. M.
• Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
  Koana, Tomohiro ; Komusiewicz, Christian ; Sommer, Frank
• Essentially Tight Kernels for (Weakly) Closed Graphs
  Koana, Tomohiro ; Komusiewicz, Christian ; Sommer, Frank
• A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
  Kangas, Kustaa ; Koivisto, Mikko O. ; Salonen, Sami
• The algorithm and complexity of co-secure domination in geometric intersection graphs
  Wang, Cai-Xia ; Yang, Yu ; Xu, Shou-Jun