Message delay and DisCSP search algorithms

DOI10.1007/s10472-006-9033-2zbMath1107.68106MaRDI QIDQ862557

Roie Zivan, Amnon Meisels

Publication date: 24 January 2007

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-006-9033-2

zbMATH Keywords

search; distributed AI; distributed constraint satisfaction

Mathematics Subject Classification ID

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

68W15: Distributed algorithms

Related Items

Concurrent forward bounding for distributed constraint optimization problems, Nogood-based asynchronous forward checking algorithms, Hybrid search for minimal perturbation in dynamic CSPs, Distributed constraint satisfaction with partially known constraints, Dynamic ordering for asynchronous backtracking on DisCSPs, Forward bounding on pseudo-trees for DCOPs and ADCOPs, Incentive-based search for equilibria in Boolean games, Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems, Concurrent search for distributed CSPs, On the Complexity of Concurrent Multiset Rewriting

Uses Software

• SensorDCSP

Cites Work

• Unnamed Item
• Unnamed Item
• Asynchronous forward-checking for DisCSPs
• Concurrent search for distributed CSPs
• Asynchronous backtracking without adding links: a new member in the ABT family
• Asynchronous aggregation and consistency in distributed constraint satisfaction
• Sensor networks and distributed CSP: communication, computation and complexity
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Time, clocks, and the ordering of events in a distributed system