6279 search results - page 338 / 1256 » Studies in Solution Sampling |
179
click to vote
IJCAI
2001
15 years 8 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...
174
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
160
click to vote
CJ
2008
15 years 6 months ago
2008
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
168
click to vote
MP
2006
15 years 6 months ago
2006
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...
165
click to vote
PAMI
2006
15 years 6 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...