„Constraint satisfaction“

Suchergebnisse

1.000+ Treffer

• An improved ant colony optimization algorithm with strengthened pheromone updating mechanism for constraint satisfaction problem
  Zhang, Qin ; Zhang, Changsheng
• Process Chain-Oriented Design Evaluation of Multi-Material Components by Knowledge-Based Engineering
  Herrmann, Kevin ; Plappert, Stefan ; Gembarski, Paul Christoph ; Lachmayer, Roland 2023 Gottfried Wilhelm Leibniz Universität Hannover
• Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
  Caragiannis, Ioannis ; Fanelli, Angelo ; Gravin, Nikolai
• The Complexity of Phylogeny Constraint Satisfaction
  Bodirsky, Manuel ; Jonsson, Peter ; Van Pham, Trung 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
  Viola, Caterina ; Živný, Stanislav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The smallest hard trees
  Bodirsky, Manuel ; Bulín, Jakub ; Starke, Florian ; Wernthaler, Michael 2024 Technische Universität Dresden
• Economic Constraints - the Growing Challenge for Western Breast Cancer Centers
  Seidel, Rene P. ; Lux, Michael Patrick ; Hoellthaler, Josef ; Beckmann, Matthias Wilhelm ; Voigt, Wieland
• Polynomial-Time Tractable Problems over the p-Adic Numbers
  Bodirsky, Manuel ; Fehm, Arno 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Temporal Valued Constraint Satisfaction Problems
  Bodirsky, Manuel ; Bonnet, Édouard ; Semanišinová, Žaneta 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Network Satisfaction Problems Solved by k-Consistency
  Bodirsky, Manuel ; Knäuer, Simon 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters
  Bodlaender, Hans L. ; Groenland, Carla ; Pilipczuk, Michał 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Datalog-Expressibility for Monadic and Guarded Second-Order Logic
  Bodirsky, Manuel ; Knäuer, Simon ; Rudolph, Sebastian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems
  Huguet, Marie-José ; Lopez, Pierre ; Karoui, Wafa
• Embedded DNN-based nonlinear MPC with guaranteed constraint satisfaction
  Mohanty, Nirlipta Ranjan ; Ubare, Promod ; Patne, Vaishali ; Ingole, Deepak ; Sonawane, Dayaram
• Don’t Worry, Be Happy—Does the CEO’s Personality Mitigate the Negative Effect of Financial Constraints on Employee Satisfaction?
  Neumeyer, Laura Aglaia ; Gründler, Anna ; Stöber, Anna-Luisa
• Complexity of Local Search for CSPs Parameterized by Constraint Difference
  Anand, Aditya ; Cohen-Addad, Vincent ; D'Orsi, Tommaso ; Gupta, Anupam ; Lee, Euiwoong ; Panigrahi, Debmalya ; Peng, Sijin 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Combinatorial Search: From Algorithms to Systems
  Hamadi, Youssef 2013 Springer Berlin Heidelberg
• The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 25211)
  Bodirsky, Manuel ; Guruswami, Venkatesan ; Marx, Dániel ; Živný, Stanislav ; Semanišinová, Žaneta
• Constraint-Erfüllung und -Optimierung mithilfe von endlichen Maschinen in der Anwendung des robusten Dependenzparsings
  Didakowski, Jörg ; Menzel, Wolfgang 2022 Staats- und Universitätsbibliothek Hamburg Carl von Ossietzky
• Learning language (with) grammars: From teaching Latin to learning domain-specific grammars
  Lange, Herbert ; Ljunglöf, Peter ; Claessen, Koen ; Ranta, Aarne 2020 Leibniz-Institut für Deutsche Sprache (IDS)