Sciweavers

1662 search results - page 206 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ATAL
2005
Springer
14 years 2 months ago
Reasoning about joint beliefs for execution-time communication decisions
Just as POMDPs have been used to reason explicitly about uncertainty in single-agent systems, there has been recent interest in using multi-agent POMDPs to coordinate teams of age...
Maayan Roth, Reid G. Simmons, Manuela M. Veloso
ATAL
2006
Springer
14 years 19 days ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
CCE
2008
13 years 9 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
LATIN
2010
Springer
13 years 7 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
ECCB
2002
IEEE
14 years 1 months ago
Stochastic roadmap simulation for the study of ligand-protein interactions
The dynamics of ligand-protein interactions are necessary to understand for the design of novel therapeutic agents. In this paper, we establish the use of Stochastic Roadmap Simul...
Mehmet Serkan Apaydin, Carlos Guestrin, Chris Varm...