( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Combining Symmetry Breaking and Global Constraints.

, , и . CSCLP, том 5655 из Lecture Notes in Computer Science, стр. 84-98. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)

Witold George

Hans George

George Glowik

George Leon

 

Другие публикации лиц с тем же именем

Computational protein design as an optimization problem., , , , , , , , , и . Artif. Intell., (2014)Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation)., и . SAT, том 7317 из Lecture Notes in Computer Science, стр. 496-497. Springer, (2012)Guaranteed Diversity & Quality for the Weighted CSP., , , , , и . ICTAI, стр. 18-25. IEEE, (2019)Virtual Pairwise Consistency in Cost Function Networks., , , , и . CPAIOR, том 13884 из Lecture Notes in Computer Science, стр. 417-426. Springer, (2023)Symmetries of Symmetry Breaking Constraints., и . ECAI, том 215 из Frontiers in Artificial Intelligence and Applications, стр. 861-866. IOS Press, (2010)Finding a Collection of MUSes Incrementally., и . CPAIOR, том 9676 из Lecture Notes in Computer Science, стр. 35-44. Springer, (2016)Reasoning about Connectivity Constraints., , , и . IJCAI, стр. 2568-2574. AAAI Press, (2015)Constraint and Satisfiability Reasoning for Graph Coloring., и . J. Artif. Intell. Res., (2020)Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers., , , и . AAAI, стр. 481-488. AAAI Press, (2013)A Hybrid Approach for Exact Coloring of Massive Graphs., и . CPAIOR, том 11494 из Lecture Notes in Computer Science, стр. 374-390. Springer, (2019)