( en | de | ru )

 

Disambiguation of "Sellmann, Meinolf"

Author of the publication

copydeleteadd this publication to your clipboard
A Complete Multi-valued SAT Solver.

, , and . CP, volume 6308 of Lecture Notes in Computer Science, page 281-296. Springer, (2010)

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. You can also use the button next to the name to display some publications already assigned to the person.

Meinolf Sellmann

Werner Sellmann

Daniel Sellmann

Rüdiger Sellmann

Georg Sellmann

 

Other publications of authors with the same name

Boosting evolutionary algorithm configuration., , and . Ann. Math. Artif. Intell., 90 (7-9): 715-734 (2022)The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems., and . CPAIOR, volume 5015 of Lecture Notes in Computer Science, page 142-157. Springer, (2008)Parallel SAT Solver Selection and Scheduling., , , and . CP, volume 7514 of Lecture Notes in Computer Science, page 512-526. Springer, (2012)Heuristic Constraint Propagation., and . CP, volume 2470 of Lecture Notes in Computer Science, page 738-743. Springer, (2002)Learning Back-Clauses in SAT - (Poster Presentation)., , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 498-499. Springer, (2012)Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse., , and . CP, volume 11008 of Lecture Notes in Computer Science, page 524-534. Springer, (2018)A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT., , and . AAAI, page 48-53. AAAI Press, (2011)Predisaster Preparation of Transportation Networks., and . AAAI, page 709-715. AAAI Press, (2015)Approximated Consistency for Knapsack Constraints.. CP, volume 2833 of Lecture Notes in Computer Science, page 679-693. Springer, (2003)Stochastic Offline Programming., and . ICTAI, page 784-791. IEEE Computer Society, (2009)