Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Greedy Algorithms for Sequential Sensing Decisions Hannaneh Hajishirzi Afsaneh Shirazi Jaesik Choi Eyal Amir
 

Summary: Greedy Algorithms for Sequential Sensing Decisions
Hannaneh Hajishirzi Afsaneh Shirazi Jaesik Choi Eyal Amir
Computer Science Department
University of Illinois at Urbana-Champaign
Urbana, IL 61801, USA
{hajishir, hajiamin, jaesik, eyal}@illinois.edu
Abstract
In many real-world situations we are charged with
detecting change as soon as possible. Important
examples include detecting medical conditions, de-
tecting security breaches, and updating caches of
distributed databases. In those situations, sensing
can be expensive, but it is also important to detect
change in a timely manner.
In this paper we present tractable greedy algorithms
and prove that they solve this decision problem ei-
ther optimally or approximate the optimal solution
in many cases. Our problem model is a POMDP
that includes a cost for sensing, a cost for delayed
detection, a reward for successful detection, and

  

Source: Amir, Eyal - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collections: Computer Technologies and Information Sciences