Sciweavers

3221 search results - page 513 / 645
» Termination of Linear Programs
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
16 years 27 days ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
16 years 27 days ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
CPAIOR
2009
Springer
16 years 26 days ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
DCOSS
2009
Springer
16 years 26 days ago
Cheap or Flexible Sensor Coverage
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...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
MFCS
2009
Springer
16 years 25 days ago
Balanced Paths in Colored Graphs
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...