Sensor networks and distributed CSP: communication, computation and complexity
From MaRDI portal
Publication:2457701
Recommendations
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- Message delay and DisCSP search algorithms
- Message delay and asynchronous DisCSP search
- Concurrent search for distributed CSPs
- scientific article; zbMATH DE number 2084748
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 614990 (Why is no real title available?)
- scientific article; zbMATH DE number 2084748 (Why is no real title available?)
- scientific article; zbMATH DE number 1515287 (Why is no real title available?)
- A distributed arc-consistency algorithm
- Complexity results for standard benchmark domains in planning
- Determining computational complexity from characteristic ``phase transitions
- Multistage negotiation for distributed constraint satisfaction
- On the Complexity of General Graph Factor Problems
- Open constraint optimization
Cited in
(8)- SOFSEM 2006: Theory and Practice of Computer Science
- Message delay and DisCSP search algorithms
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- An efficient distributed optimization and coordination protocol: application to the emergency vehicle management
- SensorDCSP
- Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
- Nogood-based asynchronous forward checking algorithms
- Centdian Computation for Sensor Networks
This page was built for publication: Sensor networks and distributed CSP: communication, computation and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457701)