Dynamic Ordering for Asynchronous Backtracking on DisCSPs

DOI10.1007/11564751_6MaRDI QIDQ3524162zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Dynamic ordering for asynchronous backtracking on DisCSPs
• Min-domain retroactive ordering for asynchronous backtracking
• Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
• Asynchronous backtracking without adding links: a new member in the ABT family
• Improving ABT Performance by Adding Synchronization Points

Cited in

(13)

• Incentive-based search for equilibria in Boolean games
• A distributed optimization method for the geographically distributed data centres problem
• Privacy stochastic games in distributed constraint reasoning
• Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
• Concurrent search for distributed CSPs
• Asynchronous backtracking without adding links: a new member in the ABT family
• Concurrent forward bounding for distributed constraint optimization problems
• Corrigendum to: ``Min-domain retroactive ordering for asynchronous backtracking
• Improving ABT Performance by Adding Synchronization Points
• Min-domain retroactive ordering for asynchronous backtracking
• Dynamic ordering for asynchronous backtracking on DisCSPs
• Message delay and DisCSP search algorithms
• Asynchronous forward-checking for DisCSPs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524162)