4843 search results - page 496 / 969 » The Shortcut Problem - Complexity and Approximation |
148
Voted
AAAI
2010
15 years 8 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...
147
click to vote
ALENEX
2007
15 years 8 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
160
Voted
DAGSTUHL
2008
15 years 8 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...
188
click to vote
ESANN
2008
15 years 8 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...
171
Voted
ICMLA
2008
15 years 8 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. ...