4894 search results - page 507 / 979 » The Guarding Problem - Complexity and Approximation |
115
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
114
click to vote
AAAI
2010
15 years 6 months ago
2010
Automatically constructing novel representations of tasks from analysis of state spaces is a longstanding fundamental challenge in AI. I review recent progress on this problem for...
123
click to vote
DAGSTUHL
2008
15 years 6 months ago
2008
The Exact Geometric Computation (EGC) mode of computation has been developed over the last decade in response to the widespread problem of numerical non-robustness in geometric al...
157
Voted
ESANN
2008
15 years 6 months ago
2008
Using multilayer perceptrons (MLPs) to approximate the state-action value function in reinforcement learning (RL) algorithms could become a nightmare due to the constant possibilit...
140
click to vote
ICMLA
2008
15 years 6 months ago
2008
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...