780 search results - page 65 / 156 » Cost-Sharing Approximations for h |
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
JMLR
2010
14 years 6 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
SIAMCO
2010
14 years 6 months ago
2010
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
SIAMNUM
2010
14 years 6 months ago
2010
In the numerical simulation of many practical problems in physics and engineering, finite volume methods are an important and popular class of discretization methods due to the loc...
ICML
2005
IEEE
16 years 1 days ago
2005
IEEE
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...