4894 search results - page 508 / 979 » The Guarding Problem - Complexity and Approximation |
129
click to vote
AIPS
2004
15 years 6 months ago
2004
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
130
click to vote
IJCAI
2003
15 years 6 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
125
click to vote
WSC
2001
15 years 6 months ago
2001
Parameters of statistical distributions that are input to simulations are typically not known with certainty. For existing systems, or variations on existing systems, they are oft...
132
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
131
click to vote
ECAI
2010
Springer
15 years 6 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...