1662 search results - page 207 / 333 » The Computational Complexity of Agent Design Problems |
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
CAISE
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. The proliferation of interconnected computing devices is fostering the emergence of environments where Web services made available to mobile users are a commodity. Unfort...
JSSPP
2010
Springer
13 years 6 months ago
2010
Springer
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
AIPS
2008
13 years 11 months ago
2008
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...