Min-domain retroactive ordering for asynchronous backtracking

DOI10.1007/s10601-008-9046-zzbMath1191.68644MaRDI QIDQ842785

Roie Zivan, Moshe Zazone, Amnon Meisels

Publication date: 25 September 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9046-z

zbMATH Keywords

search; distributed constraint satisfaction; ordering heuristics

Mathematics Subject Classification ID

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

Related Items

Concurrent forward bounding for distributed constraint optimization problems, Corrigendum to: ``Min-domain retroactive ordering for asynchronous backtracking, Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems

Uses Software

• CSPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic ordering for asynchronous backtracking on DisCSPs
• Asynchronous forward-checking for DisCSPs
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Asynchronous backtracking without adding links: a new member in the ABT family
• Asynchronous aggregation and consistency in distributed constraint satisfaction
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Time, clocks, and the ordering of events in a distributed system
• Recent Advances in Constraints