447 search results - page 30 / 90 » Decision trees with minimal costs |
ICML
2005
IEEE
14 years 9 months 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...
COCOON
2009
Springer
14 years 3 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
HIPC
2007
Springer
14 years 3 months ago
2007
Springer
This paper presents our work in combining peer-to-peer dynamic tree management with hierarchical Operational Transformation (OT) over document trees to achieve low computational an...
DAC
1989
ACM
14 years 27 days ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...