153 search results - page 2 / 31 » Some Decision Problems of Enormous Complexity |
NIPS
2007
13 years 6 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
AAAI
2011
12 years 4 months ago
2011
In environmental and natural resource planning domains actions are taken at a large number of locations over multiple time periods. These problems have enormous state and action s...
JAR
2006
13 years 4 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
CORR
2012
Springer
12 years 19 days ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...