Sciweavers

2922 search results - page 73 / 585
» Scalable Algorithms for Distribution Search
Sort
View
ATAL
2006
Springer
15 years 5 months ago
Scalable and reliable data delivery in mobile ad hoc sensor networks
This paper studies scalable data delivery algorithms in mobile ad hoc sensor networks with node and link failures. Many algorithms have been developed for data delivery and fusion...
Bin Yu, Paul Scerri, Katia P. Sycara, Yang Xu, Mic...
87
Voted
EUROSIM
1994
15 years 3 months ago
Pact: An Environment for Parallel Heuristic Programming
This paper introduces Pact, a new model for parallel heuristic programming on MIMD machines. Designed and implemented as an integrated tool environment, Pact allows the user to dev...
Marc Aguilar, Béat Hirsbrunner
87
Voted
ATAL
2008
Springer
15 years 3 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
ATAL
2009
Springer
15 years 8 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig
122
Voted
ICPP
2007
IEEE
15 years 8 months ago
ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
Peng Gu, Jun Wang, Hailong Cai