Sciweavers

54 search results - page 10 / 11
» No-commitment branch and bound search for distributed constr...
Sort
View
ATAL
2010
Springer
14 years 10 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
LCTRTS
2001
Springer
15 years 1 months ago
Power-Aware Design Synthesis Techniques for Distributed Real-Time Systems
This paper presents an end-to-end synthesis technique for lowpower distributed real-time system design. This technique synthesizes supply voltages of resources to optimize system-...
Dong-In Kang, Stephen P. Crago, Jinwoo Suh
ATAL
2008
Springer
14 years 11 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
ICDCS
1999
IEEE
15 years 1 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
82
Voted
MOBIHOC
2010
ACM
14 years 7 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...