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

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

Christian Bessiere, Ismel Brito, Pedro Meseguer, Arnold Maestre

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

search; constraint satisfaction; distributed problem solving

Mathematics Subject Classification ID

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

68W15: Distributed algorithms

Related Items

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

Cites Work

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