Message delay and DisCSP search algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- scientific article; zbMATH DE number 2080333 (Why is no real title available?)
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Asynchronous backtracking without adding links: a new member in the ABT family
- Asynchronous forward-checking for DisCSPs
- Concurrent search for distributed CSPs
- Dynamic Ordering for Asynchronous Backtracking on DisCSPs
- Sensor networks and distributed CSP: communication, computation and complexity
- Time, clocks, and the ordering of events in a distributed system
Cited in
(13)- Incentive-based search for equilibria in Boolean games
- Concurrent search for distributed CSPs
- Concurrent forward bounding for distributed constraint optimization problems
- Sensor networks and distributed CSP: communication, computation and complexity
- On the complexity of concurrent multiset rewriting
- Forward bounding on pseudo-trees for DCOPs and ADCOPs
- Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
- Nogood-based asynchronous forward checking algorithms
- Hybrid search for minimal perturbation in dynamic CSPs
- Distributed constraint satisfaction with partially known constraints
- Message delay and asynchronous DisCSP search
- Dynamic ordering for asynchronous backtracking on DisCSPs
- Communication-Aware Local Search for Distributed Constraint Optimization
This page was built for publication: Message delay and DisCSP search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862557)