( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving the task variant allocation problem in distributed robotics.

, , , , , , и . Auton. Robots, 42 (7): 1477-1495 (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.

Ciarán Nicholl

Ciaran Toal

Ciaran Wills

Ciaran O'Reilly

 

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

Morphing Between Stable Matching Problems., , и . CP, том 9892 из Lecture Notes in Computer Science, стр. 832-840. Springer, (2016)Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem., и . CP, том 8656 из Lecture Notes in Computer Science, стр. 549-563. Springer, (2014)Proof Logging for the Circuit Constraint., , и . CPAIOR (2), том 14743 из Lecture Notes in Computer Science, стр. 38-55. Springer, (2024)Certified Symmetry and Dominance Breaking for Combinatorial Optimisation., , , и . CoRR, (2022)Greedy Graph Colouring is a Misleading Heuristic., и . CoRR, (2013)Understanding the Empirical Hardness of Random Optimisation Problems., , и . CP, том 11802 из Lecture Notes in Computer Science, стр. 333-349. Springer, (2019)Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms., , , , , и . CP, том 307 из LIPIcs, стр. 9:1-9:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Complications for Computational Experiments from Modern Processors., , , и . CP, том 210 из LIPIcs, стр. 25:1-25:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Sequential and Parallel Solution-Biased Search for Subgraph Algorithms., , , , , и . CPAIOR, том 11494 из Lecture Notes in Computer Science, стр. 20-38. Springer, (2019)The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants., , и . ICGT, том 12150 из Lecture Notes in Computer Science, стр. 316-324. Springer, (2020)