Sciweavers

8413 search results - page 44 / 1683
» Ordering Problem Subgoals
Sort
View
CSCLP
2004
Springer
14 years 1 months ago
A Value Ordering Heuristic for Local Search in Distributed Resource Allocation
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
Adrian Petcu, Boi Faltings
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
ICML
2000
IEEE
14 years 8 months ago
Eligibility Traces for Off-Policy Policy Evaluation
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
Doina Precup, Richard S. Sutton, Satinder P. Singh
CVPR
2011
IEEE
13 years 4 months ago
Inference for Order Reduction in Markov Random Fields
This paper presents an algorithm for order reduction of factors in High-Order Markov Random Fields (HOMRFs). Standard techniques for transforming arbitrary high-order factors in...
Andrew C. Gallagher, Dhruv Batra, Devi Parikh
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
14 years 1 months ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev