„algorithm complexity“

Suchergebnisse

4.228 Treffer

• A hybrid method of evolutionary algorithm and simple cell mapping for multi-objective optimization problems
  Naranjani, Yousef ; Hernández, Carlos ; Xiong, Fu-Rui ; Schütze, Oliver ; Sun, Jian-Qiao
• Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
  Dang, Duc-Cuong ; Lehre, Per Kristian
• Robustness of Populations in Stochastic Environments
  Gießen, Christian ; Kötzing, Timo
• Concentration of First Hitting Times Under Additive Drift
  Kötzing, Timo
• Superpolynomial Lower Bounds for the $$(1+1)$$ ( 1 + 1 ) EA on Some Easy Combinatorial Problems
  Sutton, Andrew M.
• MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions
  Lissovoi, Andrei ; Witt, Carsten
• Non-interactive proofs of proximity
  Gur, Tom ; Rothblum, Ron D.
• Advances in Algorithms, Languages, and Complexity
  1997 Springer US
• On the connection between interval size functions and path counting
  Bampas, Evangelos ; Göbel, Andreas-Nikolas ; Pagourtzis, Aris ; Tentes, Aris
• Strategyproof Mechanisms for Competitive Influence in Networks
  Borodin, Allan ; Braverman, Mark ; Lucier, Brendan ; Oren, Joel
• An External-Memory Algorithm for String Graph Construction
  Bonizzoni, Paola ; Della Vedova, Gianluca ; Pirola, Yuri ; Previtali, Marco ; Rizzi, Raffaella
• Radar target recognition algorithm based on RCS observation sequence — set-valued identification method
  Wang, Ting ; Bi, Wenjian ; Zhao, Yanlong ; Xue, Wenchao
• On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
  Sun, Yao ; Huang, Zhenyu ; Lin, Dongdai ; Wang, Dingkang
• Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin
  Kayal, Neeraj ; Saha, Chandan
• Sunflowers and Testing Triangle-Freeness of Functions
  Haviv, Ishay ; Xie, Ning
• The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments
  Traxler, Patrick
• AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
  Dell, Holger
• Solving Linear Equations Parameterized by Hamming Weight
  Arvind, V. ; Köbler, Johannes ; Kuhnert, Sebastian ; Torán, Jacobo
• On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
  Razgon, Igor
• Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
  Bulian, Jannis ; Dawar, Anuj