A General Paradigm for A.I. Search Procedures
Abstract
This paper summarizes work on a General Branch and Bound formulation which includes previous formulations as special cases and provides a unified approach to understanding most heuristic search procedures developed in A.I. A wide class of problems arising in Operations Research, decision making and Artificial Intelligence can be (abstractly) stated in the following form:
Cite
Text
Nau et al. "A General Paradigm for A.I. Search Procedures." AAAI Conference on Artificial Intelligence, 1982.Markdown
[Nau et al. "A General Paradigm for A.I. Search Procedures." AAAI Conference on Artificial Intelligence, 1982.](https://mlanthology.org/aaai/1982/nau1982aaai-general/)BibTeX
@inproceedings{nau1982aaai-general,
title = {{A General Paradigm for A.I. Search Procedures}},
author = {Nau, Dana S. and Kumar, Vipin and Kanal, Laveen N.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1982},
pages = {120-123},
url = {https://mlanthology.org/aaai/1982/nau1982aaai-general/}
}