Dynamic Ordering for Asynchronous Backtracking on DisCSPs

DOI10.1007/11564751_6zbMath1153.68498OpenAlexW2604675983MaRDI QIDQ3524162

Roie Zivan, Amnon Meisels

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_6

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

Min-domain retroactive ordering for asynchronous backtracking ⋮ Improving ABT Performance by Adding Synchronization Points ⋮ Dynamic ordering for asynchronous backtracking on DisCSPs ⋮ Message delay and DisCSP search algorithms ⋮ Concurrent forward bounding for distributed constraint optimization problems ⋮ Asynchronous forward-checking for DisCSPs ⋮ Privacy stochastic games in distributed constraint reasoning ⋮ Concurrent search for distributed CSPs ⋮ Incentive-based search for equilibria in Boolean games ⋮ A distributed optimization method for the geographically distributed data centres problem

This page was built for publication: Dynamic Ordering for Asynchronous Backtracking on DisCSPs