3875 search results - page 402 / 775 » Approximation algorithms for the 0-extension problem |
160
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
163
click to vote
AOR
2007
15 years 7 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
197
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
147
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
171
click to vote
CCCG
1994
15 years 8 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...