From post

Processing Online SAT Instances with Waiting Time Constraints and Completion Weights.

, , и . LOD, том 11331 из Lecture Notes in Computer Science, стр. 418-430. Springer, (2018)

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.

 

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

Using sequential runtime distributions for the parallel speedup prediction of SAT local search., , и . Theory Pract. Log. Program., 13 (4-5): 625-639 (2013)Learning a Stopping Criterion for Local Search., и . LION, том 10079 из Lecture Notes in Computer Science, стр. 3-16. Springer, (2016)Optimising dual homing for long-reach passive optical networks., , , и . DRCN, стр. 235-242. IEEE, (2015)Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms., , и . ICTAI, стр. 655-662. IEEE Computer Society, (2016)Processing Online SAT Instances with Waiting Time Constraints and Completion Weights., , и . LOD, том 11331 из Lecture Notes in Computer Science, стр. 418-430. Springer, (2018)Building Portfolios for the Protein Structure Prediction Problem., , и . WCB@ICLP, том 4 из EPiC Series in Computing, стр. 2-7. EasyChair, (2010)Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains., , и . CP, том 235 из LIPIcs, стр. 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Towards Massively Parallel Local Search for SAT - (Poster Presentation)., и . SAT, том 7317 из Lecture Notes in Computer Science, стр. 481-482. Springer, (2012)Constraint Programming and Machine Learning for Interactive Soccer Analysis., , и . LION, том 10079 из Lecture Notes in Computer Science, стр. 240-246. Springer, (2016)Constraint-Based Local Search for the Distance- and Capacity-Bounded Network Design Problem., , , и . ICTAI, стр. 178-185. IEEE Computer Society, (2014)