A learning-based algorithm selection meta-reasoner for the real-time MPE problem

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3339, Issue , 2004, Pages 307-318

  Guo, Haipeng ^a   Hsu, William H ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b Sunflower Networking Group   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DECISION SUPPORT SYSTEMS; LEARNING ALGORITHMS; LEARNING SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

INTERFERENCE ALGORITHMS; LEARNING-BASED ALGORITHMS; META-REASONING; REAL-TIME DOMAINS;

REAL TIME SYSTEMS;

EID: 22944472703     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30549-1_28     Document Type: Conference Paper

References (19)

1. Abdelbar, A. M., Hedetniemi, S. M.: Approximating MAPs for belief networks in NP-hard and other theorems. Artificial Intelligence. 102 (1998) 21-38
2. Breese, J. S., Horvitz, E.: Ideal reformulation of belief networks. In UAI90. (1990) 129-144
3. Fung, R., Chang, K. C.: Weighting and integrating evidence for stochastic simulation in Bayesian networks. In UAI89. (1989) 209-219
4. Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Boston. (1997)
5. Gomes, C. P., Selman, B.: Algorithm portfolio design: theory vs. practice. In UAI97. (1997) 190-197
6. Guo, H.: Algorithm selection for sorting and probabilistic inference: a machine learning-based approach. PhD thesis, Kansas State University. (2003)
7. Horvitz, E.: Computation and action under bounded resources. PhD thesis, Stanford University. (1990)
8. Horvitz, E., Ruan, Y., Kautz, H., Selman, B., Chickering, D. M.: A Bayesian approach to tackling hard computational problems. In UAI01. (2001) 235-244
9. Ide, J. S., Cozman F. G.: Random generation of Bayesian networks. In Brazlian Symposium on Artificial Intelligence, Pernambuco Brazil. (2002)
10. Jitnah, N., Nicholson, A. E.,: Belief network algorithms: A study of performance based on domain characterization. In Learning and Reasoning with Complex Representations. 1359 Springer-Verlag (1998) 169-188
11. Johnson, D.: A theoretician's guide to the experimental analysis of algorithms. In M. H. Goldwasser and D. S. Johnson and C. C. McGeoch, editors, Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges. (2002) 215-250
12. Lauritzen, S. L., Spiegelhalter, D. J.: Local computations with probabilities on graphical structures and their application to expert systems (with discussion). J. Royal Statist. Soc. Series B 50 (1988) 157-224
13. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA, Morgan-Kaufmann. (1988)
14. Rice, J. R.: The algorithm selection problem. In M. V. Zelkowitz, editors, Advances in computers. 15 (1976) 65-118
15. Shimony, S. E.: Finding MAPs for belief networks is NP-hard. Artificial Intelligence. 68 (1994) 399-410
16. Shimony, S. E., Domshlak, C.: Complexity of probabilistic reasoning in directed-path singly connected Bayes networks. Artificial Intelligence. 151 (2003) 213-225
17. Santos, E., Shimony, S. E., Williams, E.: On a distributed anytime architecture for probabilistic reasoning. Technique Report AFIT/EN/TR94-06. Department of Electrical and Computer Engineering, Air Force Institute of Technology. (1995)
18. Witten, I. H., Frank, E. Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann. (1999)
19. Zilberstein, S.: Operational rationality through compilation of anytime algorithms. PhD Thesis. University of California at Berkeley. (1993)