Asynchronous forward-checking for DisCSPs

DOI10.1007/s10601-006-9013-5zbMath1118.68158OpenAlexW2116744268MaRDI QIDQ879978

Roie Zivan, Amnon Meisels

Publication date: 10 May 2007

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-006-9013-5

zbMATH Keywords

Asynchronous searchDistributed CSPsForward-checking

Mathematics Subject Classification ID

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

Related Items (7)

Min-domain retroactive ordering for asynchronous backtracking ⋮ Dynamic ordering for asynchronous backtracking on DisCSPs ⋮ Message delay and DisCSP search algorithms ⋮ Forward bounding on pseudo-trees for DCOPs and ADCOPs ⋮ Nogood-based asynchronous forward checking algorithms ⋮ A distributed optimization method for the geographically distributed data centres problem ⋮ Probabilistic optimal solution assessment for DCOPs

Cites Work

• Unnamed Item
• Unnamed Item
• A theoretical evaluation of selected backtracking algorithms.
• Asynchronous backtracking without adding links: a new member in the ABT family
• Asynchronous aggregation and consistency in distributed constraint satisfaction
• Secure distributed constraint satisfaction: reaching agreement without revealing private information
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Time, clocks, and the ordering of events in a distributed system
• Recent Advances in Constraints
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Asynchronous forward-checking for DisCSPs