Observation subset selection as local compilation of performance profiles

Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008

Volumn , Issue , 2008, Pages 460-467

  Radovilsky, Yan ^a   Eyal Shimony, Solomon ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME ALGORITHM; COMPILATION TECHNIQUES; DEPENDENCY STRUCTURES; GAUSSIANS; GENERAL CLASS; MONOTONICITY; NON-ADDITIVE; OPTIMAL SETS; PERFORMANCE PROFILE; SUBSET SELECTION; UTILITY FUNCTIONS;

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 77956027270     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. M. Boddy and T. Dean. Solving time-dependent planning problems. In IJCAI, pages 979-984, 1989.
2. A. Cassandra, M. L. Littman, and N. L. Zhang. Incremental Pruning: A simple, fast, exact method for partially observable Markov decision processes. In Proceedings of (UAI-97), pages 54-61, 1997.
3. E. Horvitz. Reasoning about beliefs and actions under computational resource constraints. In UAI, pages 301-324, 1987.
4. E. Horvitz. Models of continual computation. In AAAI/IAAI, pages 286-293, 1997.
5. E. Horvitz. Continual computation policies for allocating offline and real-time resources. In IJCAI, pages 1280-1287, 1999.
6. A. Krause and C. Guestrin. Near-optimal nonmyopic value of information in graphical models. In UAI, pages 324-331, 2005.
7. A. Krause and C. Guestrin. Optimal nonmyopic value of information in graphical models - efficient algorithms and theoretical limits. In IJCAI, pages 1339-1345, 2005.
8. A. I. Mouaddib and S. Zilberstein. Knowledge-based anytime computation. In IJCAI, pages 775-783, 1995.
9. Y. Radovilsky, G. Shattah, and E. S. Shimony. Efficient deterministic approximation algorithm for nonmyopic value of information in graphical models. In SMC Conference, Taipei, Taiwan, 2006.
10. S. Zilberstein. Operational rationality through compilation of anytime algorithms. Technical report, Computer Science Division, University of California at Berkeley, 1993. PhD Dissertation.
11. S. Zilberstein. Optimizing decision quality with contract algorithms. In IJCAI, pages 1576-1582, 1995.
12. S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73-83, 1996. (Pubitemid 126669856)