„Dynamic algorithms“

Suchergebnisse

1.665 Treffer

• Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding
  Kiirala, Niko ; Salmela, Leena ; Tomescu, Alexandru I. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dominating Sets and Connected Dominating Sets in Dynamic Graphs
  Hjuler, Niklas ; Italiano, Giuseppe F. ; Parotsidis, Nikos ; Saulpic, David 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)
  Stein, Clifford 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty
  Hunsberger, Luke ; Posenato, Roberto 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Dynamic Graph Coloring
  Solomon, Shay ; Wein, Nicole 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
  Goranci, Gramoz ; Henzinger, Monika ; Peng, Pan 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• FPT Algorithms for Embedding into Low Complexity Graphic Metrics
  Ghosh, Arijit ; Kolay, Sudeshna ; Mishra, Gopinath 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Weighted Model Counting on the GPU by Exploiting Small Treewidth
  Fichte, Johannes Klaus ; Hecher, Markus ; Woltran, Stefan ; Zisser, Markus 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Online Facility Location with Deletions
  Cygan, Marek ; Czumaj, Artur ; Mucha, Marcin ; Sankowski, Piotr 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
  Kowalski, Dariusz R. ; Mosteiro, Miguel A. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fully Dynamic MIS in Uniformly Sparse Graphs
  Onak, Krzysztof ; Schieber, Baruch ; Solomon, Shay ; Wein, Nicole 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier
  Charikar, Moses ; Solomon, Shay 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
  Arar, Moab ; Chechik, Shiri ; Cohen, Sarel ; Stein, Cliff ; Wajc, David 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms
  Amir, Amihood ; Boneh, Itai 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An extended analysis of approximation algorithms for k-median problems on complex networks
  Pozo, Roldan
• Comparative analysis of recursive and nonrecursive linearization-based estimation algorithms
  Isaev, Alexey ; Stepanov, Oleg ; Litvinenko, Yulia
• Leveraging cultural algorithms for FOPID controllers with objective function analysis
  Patel, Tigmanshu ; Patel, Upesh ; Upadhyaya, Trushit ; Shah, Vishal
• Investigation on method of characteristics and semi-implicit method for pressure linked equations algorithms for water hammer based on unsteady friction
  Liu, Zong-ku ; Wu, Guo-hong ; Wang, Hao ; Zhang, Jia-xiang ; Tang, Xue-lin ; Li, Xiao-qin
• Temporal Hierarchical Clustering
  Dey, Tamal K. ; Rossi, Alfred ; Sidiropoulos, Anastasios 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Simple Greedy Algorithm for Dynamic Graph Orientation
  Berglin, Edvin ; Stølting Brodal, Gerth 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik