107 search results - page 3 / 22 » Random sampling and approximation of MAX-CSP problems |
NIPS
2007
13 years 7 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
ICDE
2006
IEEE
14 years 7 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
SIAMJO
2008
13 years 5 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
IROS
2007
IEEE
14 years 2 days ago
2007
IEEE
: This paper presents a coarse coding technique and an action selection scheme for reinforcement learning (RL) in multi-dimensional and continuous state-action spaces following con...
SIAMJO
2002
13 years 5 months ago
2002
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...