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 ...
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,...
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, ...
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 ...
– 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...