1662 search results - page 141 / 333 » The Computational Complexity of Agent Design Problems |
112
click to vote
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Ever-increasing demand for computing capability is driving the construction of ever-larger computer clusters, soon to be reaching tens of thousands of processors. Many fu...
134
click to vote
MEMOCODE
2006
IEEE
15 years 9 months ago
2006
IEEE
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
165
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
The current challenge for crowd simulations is the design and development of a scalable system that is capable of simulating the individual behavior of millions of complex agents ...
131
click to vote
CSE
2008
IEEE
15 years 5 months ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
160
click to vote
AAAI
2012
13 years 6 months ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...