3019 search results - page 302 / 604 » Approximating the Domatic Number |
195
click to vote
UAI
2008
15 years 8 months ago
2008
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
198
click to vote
NIPS
2001
15 years 8 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
139
click to vote
UAI
2001
15 years 8 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
162
click to vote
SIROCCO
2004
15 years 8 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
145
click to vote
WSC
2004
15 years 8 months ago
2004
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...