( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Integer and Constraint Programming for Batch Annealing Process Planning.

, и . CP, том 10416 из Lecture Notes in Computer Science, стр. 431-439. Springer, (2017)

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.

Jan-Willem G van de Kuilen

Jan-Willem Liebezeit

Jan Willem Baljet

Jan-Willem Jensen

Jan-Willem Roorda

 

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

Connections in Networks: A Hybrid Approach., , и . CPAIOR, том 5015 из Lecture Notes in Computer Science, стр. 303-307. Springer, (2008)A Lagrangian Relaxation for Golomb Rulers., и . CPAIOR, том 7874 из Lecture Notes in Computer Science, стр. 251-267. Springer, (2013)Constraint Programming for Distributed Planning and Scheduling., , и . AAAI Spring Symposium: Distributed Plan and Schedule Management, стр. 157-158. AAAI, (2006)Heuristics for MDD Propagation in HADDOCK., , и . CP, том 235 из LIPIcs, стр. 24:1-24:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Multi-Label A* Algorithm for Multi-Agent Pathfinding., , и . ICAPS, стр. 181-185. AAAI Press, (2019)Constraint Reasoning Embedded Structured Prediction., , , и . J. Mach. Learn. Res., (2022)Memory-Efficient Sequential Pattern Mining with Hybrid Tries., , и . J. Mach. Learn. Res., (2024)MDD Propagation for Sequence Constraints., , и . J. Artif. Intell. Res., (2014)Flow-Based Combinatorial Chance Constraints., , и . CPAIOR, том 7298 из Lecture Notes in Computer Science, стр. 129-145. Springer, (2012)Connections in Networks: Hardness of Feasibility Versus Optimality., , , , и . CPAIOR, том 4510 из Lecture Notes in Computer Science, стр. 16-28. Springer, (2007)