„solution algorithm“

Suchergebnisse

1.442 Treffer

• Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401)
  Markakis, Evangelos ; Mehta, Ruta ; Zick, Yair
• A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem
  He, Jun ; Zhou, Yuren ; Yao, Xin
• Combining randomized and deterministic iterative algorithms for high accuracy solution of large linear systems and boundary integral equations
  Sabel'fel'd, Karl K. ; Agarkov, Georgy
• Enhanced bio-adsorbent derived from turnip leaves for crystal violet removal in aqueous solutions: experimental investigation, characterization, and machine learning modeling
  Kaboub, Dounya ; Khelili, Hinda ; Guellal, Messaoud ; Konan, Kouamé Gervais ; Hentabli, Mohamed ; Amrane, Abdeltif
• A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications
  Gangam, Rohith Reddy ; Mai, Tung ; Raju, Nitya ; Vazirani, Vijay V. 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A General Framework for Enumerating Equivalence Classes of Solutions
  Wang, Yishu ; Mary, Arnaud ; Sagot, Marie-France ; Sinaimeri, Blerina 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms for Diverse Multistage Problems
  Kellerhals, Leon ; Renken, Malte ; Zschoche, Philipp 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT
  Hoi, Gordon ; Jain, Sanjay ; Stephan, Frank 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution
  Baum, Moritz ; Buchhold, Valentin ; Sauer, Jonas ; Wagner, Dorothea ; Zündorf, Tobias 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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
• You Only Live Multiple Times: A Blackbox Solution for Reusing Crash-Stop Algorithms In Realistic Crash-Recovery Settings
  Kozhaya, David ; Maric, Ognjen ; Pignolet, Yvonne-Anne 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithmic Channel Design
  Avarikioti, Georgia ; Wang, Yuyi ; Wattenhofer, Roger 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Succinct Solution to Rmap Alignment
  Muggli, Martin D. ; Puglisi, Simon J. ; Boucher, Christina 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Self-Adaptive Explicit Iterative Algorithm for Solving the Split Common Solution Problem
  Reich, Simeon ; Tuyen, Truong Minh ; Trang, Nguyen Thi
• Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution
  Spiegelman, Alexander ; Keidar, Idit ; Malkhi, Dahlia 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• K-Best Solutions of MSO Problems on Tree-Decomposable Graphs
  Eppstein, David ; Kurz, Denis 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Local Computation Algorithms (Invited Talk)
  Rubinfeld, Ronitt 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fault Diagnosis Inverse Problems: Solution with Metaheuristics
  Llanes Santiago, Orestes ; Camps Echeverría, Lídice ; Campos Velho, Haroldo Fraga ˜deœ ; Silva Neto, Antônio José da 2019 Springer International Publishing
• Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time
  Mahoney, Michael W. ; Rao, Satish ; Wang, Di ; Zhang, Peng 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Solution to Wiehagen's Thesis
  Kötzing, Timo 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik