„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
  Miyazawa, Flávio Keidi ; Pedrosa, Lehilton L. C. ; Schouery, Rafael C. S. ; Sviridenko, Maxim ; Wakabayashi, Yoshiko
• Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems
  Fraigniaud, Pierre ; Halldórsson, Magnús M. ; Patt-Shamir, Boaz ; Rawitz, Dror ; Rosén, Adi
• A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
  Dussault, Jean-Pierre ; Frappier, Mathieu ; Gilbert, Jean Charles
• Playing Mastermind With Constant-Size Memory
  Doerr, Benjamin ; Doerr, Carola 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192)
  Gairing, Martin ; Osorio, Carolina ; Peis, Britta ; Watling, David ; Eickhoff, Katharina
• Algorithmic Folding Complexity
  Cardinal, Jean ; Demaine, Erik D. ; Demaine, Martin L. ; Imahori, Shinji ; Ito, Tsuyoshi ; Kiyomi, Masashi ; Langerman, Stefan ; Uehara, Ryuhei ; Uno, Takeaki
• A New Algorithm for the $$^K$$ K DMDGP Subclass of Distance Geometry Problems with Exact Distances
  Gonçalves, Douglas S. ; Lavor, Carlile ; Liberti, Leo ; Souza, Michael
• Feature-Based and Adaptive Rule Adaptation in Dynamic Environments
  Tabebordbar, Alireza ; Beheshti, Amin ; Benatallah, Boualem ; Barukh, Moshe Chai
• Compression of Dynamic Graphs Generated by a Duplication Model
  Turowski, Krzysztof ; Magner, Abram ; Szpankowski, Wojciech
• Online Clique Clustering
  Chrobak, Marek ; Dürr, Christoph ; Fabijan, Aleksander ; Nilsson, Bengt J.
• The Sandwich Problem for Decompositions and Almost Monotone Properties
  Chudnovsky, Maria ; de Figueiredo, Celina M. H. ; Spirkl, Sophie Theresa
• Complexity and algorithms for copy-number evolution problems
  El-Kebir, Mohammed ; Raphael, Benjamin J. ; Shamir, Ron ; Sharan, Roded ; Zaccaria, Simone ; Zehavi, Meirav ; Zeira, Ron
• Transactions on Computational Science XXIX
  Gavrilova, Marina L. ; Tan, C. J. Kenneth 2017 Springer Berlin Heidelberg
• Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks
  Hayashida, Morihiro ; Tamura, Takeyuki ; Akutsu, Tatsuya ; Zhang, Shu-Qin ; Ching, Wai-Ki
• Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs
  Chakraborty, Dibyayan ; Das, Sandip ; Foucaud, Florent ; Gahlawat, Harmender ; Lajou, Dimitri ; Roy, Bodhayan 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Parameterized Complexity View on Collapsing k-Cores
  Luo, Junjie ; Molter, Hendrik ; Suchý, Ondrej 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Preface -- 25th International Symposium on Theoretical Aspects of Computer Science
  Albers, Susanne ; Weil, Pascal 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Optimizing Urban Layout: A System Dynamics, Artificial Intelligence, and 3D Urban Information Model Approach for Active Management of City Complexity
  Wang, Hanbin ; Hijazi, Ihab ; Donaubauer, Andreas ; Kolbe, Thomas H.
• Bounding the Inefficiency of Compromise in Opinion Formation
  Caragiannis, Ioannis ; Kanellopoulos, Panagiotis ; Voudouris, Alexandros A.
• Packet Routing: Complexity and Algorithms
  Peis, Britta ; Skutella, Martin ; Wiese, Andreas