( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms.

, , и . CP, том 5732 из Lecture Notes in Computer Science, стр. 142-157. Springer, (2009)

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.

Meinolf Sellmann

Werner Sellmann

Rüdiger Sellmann

Georg Sellmann

Daniel Sellmann

 

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

Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations., , , и . CoRR, (2021)Boosting evolutionary algorithm configuration., , и . Ann. Math. Artif. Intell., 90 (7-9): 715-734 (2022)Learning Back-Clauses in SAT - (Poster Presentation)., , и . SAT, том 7317 из Lecture Notes in Computer Science, стр. 498-499. Springer, (2012)Parallel SAT Solver Selection and Scheduling., , , и . CP, том 7514 из Lecture Notes in Computer Science, стр. 512-526. Springer, (2012)Heuristic Constraint Propagation., и . CP, том 2470 из Lecture Notes in Computer Science, стр. 738-743. Springer, (2002)The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems., и . CPAIOR, том 5015 из Lecture Notes in Computer Science, стр. 142-157. Springer, (2008)Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse., , и . CP, том 11008 из Lecture Notes in Computer Science, стр. 524-534. Springer, (2018)Predisaster Preparation of Transportation Networks., и . AAAI, стр. 709-715. AAAI Press, (2015)A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT., , и . AAAI, стр. 48-53. AAAI Press, (2011)Approximated Consistency for Knapsack Constraints.. CP, том 2833 из Lecture Notes in Computer Science, стр. 679-693. Springer, (2003)