Weak-commitment search for solving constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
A distributed arc-consistency algorithm
Science of Computer Programming - Special issue on concurrent constraint programming
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A formalization of autonomous dynamic reconfiguration in distributed constraint satisfaction
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Distributed sensor network for real time tracking
Proceedings of the fifth international conference on Autonomous agents
Introduction to Algorithms
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Complexity results for standard benchmark domains in planning
Artificial Intelligence
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Communication and Computation in Distributed CSP Algorithms
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT
Eighteenth national conference on Artificial intelligence
Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Phase transitions, structure, and complexity in wireless networks
Phase transitions, structure, and complexity in wireless networks
Local search topology in planning benchmarks: an empirical analysis
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Distributed Bounded-Error Parameter and State Estimation in Networks of Sensors
Numerical Validation in Current Hardware Architectures
PRIMA '09 Proceedings of the 12th International Conference on Principles of Practice in Multi-Agent Systems
A formalization for distributed cooperative sensor resource allocation
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Improving DPOP with function filtering
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
The power of ants in solving Distributed Constraint Satisfaction Problems
Applied Soft Computing
Distributed constraint optimisation for resource limited sensor networks
Science of Computer Programming
Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach
Computer Communications
Agent-based decentralised coordination for sensor networks using the max-sum algorithm
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
We introduce SensorDCSP, a naturally distributed benchmark based on a real-world application that arises in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP) algorithms in a truly distributed setting, we use a discrete-event network simulator, which allows us to model the impact of different network traffic conditions on the performance of the algorithms. We consider two complete DisCSP algorithms: asynchronous backtracking (ABT) and asynchronous weak commitment search (AWC), and perform performance comparison for these algorithms on both satisfiable and unsatisfiable instances of SensorDCSP. We found that random delays (due to network traffic or in some cases actively introduced by the agents) combined with a dynamic decentralized restart strategy can improve the performance of DisCSP algorithms. In addition, we introduce GSensorDCSP, a plain-embedded version of SensorDCSP that is closely related to various real-life dynamic tracking systems. We perform both analytical and empirical study of this benchmark domain. In particular, this benchmark allows us to study the attractiveness of solution repairing for solving a sequence of DisCSPs that represent the dynamic tracking of a set of moving objects.