Message delay and DisCSP search algorithms

DOI10.1007/S10472-006-9033-2zbMath1107.68106OpenAlexW2033296796MaRDI 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

searchdistributed AIdistributed constraint satisfaction

Mathematics Subject Classification ID

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

Related Items (11)

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

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

This page was built for publication: Message delay and DisCSP search algorithms