Asynchronous backtracking without adding links: a new member in the ABT family

DOI10.1016/j.artint.2004.10.002zbMath1132.68690OpenAlexW2164262661MaRDI QIDQ2457695

Pedro Meseguer, Arnold Maestre, Ismel Brito, Christian Bessiere

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2004.10.002

zbMATH Keywords

searchconstraint satisfactiondistributed problem solving

Mathematics Subject Classification ID

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

Related Items (12)

Min-domain retroactive ordering for asynchronous backtracking ⋮ Distributed constraint satisfaction with partially known constraints ⋮ Improving ABT Performance by Adding Synchronization Points ⋮ Dynamic ordering for asynchronous backtracking on DisCSPs ⋮ Message delay and DisCSP search algorithms ⋮ Asynchronous forward-checking for DisCSPs ⋮ Nogood-based asynchronous forward checking algorithms ⋮ Concurrent search for distributed CSPs ⋮ Corrigendum to: ``Min-domain retroactive ordering for asynchronous backtracking ⋮ A distributed optimization method for the geographically distributed data centres problem ⋮ Probabilistic optimal solution assessment for DCOPs ⋮ Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems

Cites Work

• Unnamed Item
• Network-based heuristics for constraint-satisfaction problems
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: Asynchronous backtracking without adding links: a new member in the ABT family