Asynchronous backtracking without adding links: a new member in the ABT family
From MaRDI portal
Publication:2457695
DOI10.1016/j.artint.2004.10.002zbMath1132.68690MaRDI 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
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, Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems, Concurrent search for distributed CSPs
Cites Work