485 search results - page 49 / 97 » Iterative Bounding LAO |
126
click to vote
LION
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
88
Voted
UAI
2004
15 years 1 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
88
Voted
CAD
2007
Springer
15 years 18 days ago
2007
Springer
This paper proposes an error analysis of reparametrization based approaches for planar curve offsetting. The approximation error in Hausdorff distance is computed. The error is bo...
100
Voted
JPDC
2008
15 years 16 days ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
84
Voted
ICC
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Generalize...