3820 search results - page 510 / 764 » Bounded Model Debugging |
143
Voted
UAI
2000
15 years 4 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
127
click to vote
AIPS
2009
15 years 4 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
147
click to vote
CPM
2009
Springer
15 years 4 months ago
2009
Springer
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...
106
Voted
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
The bag-of-tasks application model, albeit simple, arises in many application domains and has received a lot of attention in the scheduling literature. Previous works propose eithe...
101
click to vote
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We study the decision theory of a maximally risk-averse investor — one whose objective, in the face of stochastic uncertainties, is to minimize the probability of ever ...