Sciweavers

1662 search results - page 71 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
TSMC
2008
113views more  TSMC 2008»
13 years 8 months ago
Computational Methods for Verification of Stochastic Hybrid Systems
Stochastic hybrid system (SHS) models can be used to analyze and design complex embedded systems that operate in the presence of uncertainty and variability. Verification of reacha...
Xenofon D. Koutsoukos, Derek Riley
MOBICOM
2006
ACM
14 years 2 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
JSAC
2006
157views more  JSAC 2006»
13 years 8 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
ATAL
2009
Springer
14 years 3 months ago
Sensitivity analysis for distributed optimization with resource constraints
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
Emma Bowring, Zhengyu Yin, Rob Zinkov, Milind Tamb...
ATAL
2010
Springer
13 years 10 months ago
When should there be a "Me" in "Team"?: distributed multi-agent optimization under uncertainty
Increasing teamwork between agents typically increases the performance of a multi-agent system, at the cost of increased communication and higher computational complexity. This wo...
Matthew E. Taylor, Manish Jain, Yanquin Jin, Makot...