Back to search

South Dakota State University

Intelligent Search Under Uncertain Environments

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis - University Access Only
Discipline thesis:degree_discipline
Mathematics and Statistics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Cao, Min
Contributors dc:contributor
  • Bin Cong

Subjects

dc:subject × 2

Rights

Language dc:language
English

Identifiers

dc:identifier.*
Repository record dc:identifier
https://openprairie.sdstate.edu/etd/5724

Chain of custody

source
Harvested from
South Dakota State University
Base URL
openprairie.sdstate.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Cao, Min. Intelligent Search Under Uncertain Environments. Thesis - University Access Only thesis, https://openprairie.sdstate.edu/etd/5724