8413 search results - page 1081 / 1683 » Ordering Problem Subgoals |
175
click to vote
HIS
2008
15 years 8 months ago
2008
In this paper, we present an algorithm based on the GRASP metaheuristic for solving a dynamic assignment problem in a P2P network designed for sending real-time video over the Int...
185
click to vote
NIPS
2007
15 years 8 months ago
2007
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
220
click to vote
AIPS
2004
15 years 8 months ago
2004
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
211
click to vote
WSCG
2004
15 years 8 months ago
2004
This paper presents robust methods for determining the order of a sequence of stripes captured in an uncoded structured light scanning system, i.e. where all the stripes are proje...
212
click to vote
AIPS
2009
15 years 8 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...