Sciweavers

334 search results - page 54 / 67
» Dynamic Three-Dimensional Linear Programming
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 4 months 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
75
Voted
DCOSS
2009
Springer
15 years 4 months 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,...
ICASSP
2008
IEEE
15 years 4 months ago
Deformable trellis: open contour tracking in bio-image sequences
This paper presents an open contour tracking method that employs an arc-emission Hidden Markov Model (HMM). The algorithm encodes the shape information of the structure in a spati...
Mehmet Emre Sargin, Alphan Altinok, Kenneth Rose, ...
ISCA
2008
IEEE
89views Hardware» more  ISCA 2008»
15 years 4 months ago
Variation-Aware Application Scheduling and Power Management for Chip Multiprocessors
Within-die process variation causes individual cores in a Chip Multiprocessor (CMP) to differ substantially in both static power consumed and maximum frequency supported. In this ...
Radu Teodorescu, Josep Torrellas
ICC
2007
IEEE
141views Communications» more  ICC 2007»
15 years 3 months ago
Availability-Constrained Shared Backup Path Protection (SBPP) for GMPLS-Based Spare Capacity Reprovisioning
– Shared-backup path protection (SBPP) has been widely studied in the GMPLS networks due to its efficient spare capacity sharing and flexibility in service provisioning. This pap...
Qi Guo, Pin-Han Ho, Anwar Haque, Hussein T. Moufta...