12519 search results - page 330 / 2504 » Approximation Problems Categories |
208
click to vote
ICTAI
2006
IEEE
16 years 21 days ago
2006
IEEE
In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approx...
185
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
209
click to vote
AAAI
2006
15 years 8 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
167
click to vote
WADS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
189
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...