Sensor networks and distributed CSP: communication, computation and complexity
DOI10.1016/J.ARTINT.2004.09.002zbMATH Open1132.68688OpenAlexW2098234648MaRDI QIDQ2457701FDOQ2457701
Authors: Ramon Bejar, Carmel Domshlak, Cesar Fernandez, Carla P. Gomes, Bhaskar Krishnamachari, Bart Selman, Magda Valls 
Publication date: 23 October 2007
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10459.1/57458
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
NP-completenessphase transitionscommunication network delaysdistributed CSP benchmarkrandomized combinatorial search
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- On the Complexity of General Graph Factor Problems
- Title not available (Why is that?)
- Determining computational complexity from characteristic ``phase transitions
- A distributed arc-consistency algorithm
- Complexity results for standard benchmark domains in planning
- Open constraint optimization
- Multistage negotiation for distributed constraint satisfaction
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- An efficient distributed optimization and coordination protocol: application to the emergency vehicle management
- SensorDCSP
- Centdian Computation for Sensor Networks
- SOFSEM 2006: Theory and Practice of Computer Science
- Nogood-based asynchronous forward checking algorithms
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
- Message delay and DisCSP search algorithms
Uses Software
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)
