Off-campus South Dakota State University users: To download campus access theses, please use the following link to log into our proxy server with your South Dakota State University ID and password.

Non-South Dakota State University users: Please talk to your librarian about requesting this thesis through interlibrary loan.

Author

Min Cao

Document Type

Thesis - University Access Only

Award Date

1992

Degree Name

Master of Science (MS)

Department

Mathematics and Statistics

First Advisor

Bin Cong

Abstract

In this thesis, we also use what are called the uniform heuristic search, the partial uniform heuristic search and the nonuniform heuristic search algorithms which will be described when used. These methods combine the features of the depth-first search algorithm and the simple heuristic search algorithm. All these heuristic algorithms take less time than depth-first search algorithm, but can not guarantee an optimal solution. With the four heuristic algorithms we develop, any user can choose the elements according to the amount of time the user desires to spend. The more time one is willing to spend, the better the result one can expect. This thesis will use these algorithms in order to discuss a methodology that maps artificial intelligence problems into probability tree searches. Hopefully, this thesis will illustrate the connection between computer science and some basic mathematics.

Library of Congress Subject Headings

Probabilities
Uncertainty (Information theory)
Artificial intelligence
Algorithms

Format

application/pdf

Publisher

South Dakota State University

Share

COinS