{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd-6724"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd-6724","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Intelligent Search Under Uncertain Environments","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Cao, Min"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Bin Cong"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:02:40Z","subjects":["Mathematics","Physical Sciences and Mathematics"],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd/5724","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd/5724","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd-6724","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bin Cong"]},{"key":"dc:creator","label":"Author","values":["Cao, Min"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-08-10T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1992-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - University Access Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd/5724"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Intelligent Search Under Uncertain Environments"]}]}],"canonical_facts":{"dc:contributor":["Bin Cong"],"dc:creator":["Cao, Min"],"dc:date.available":["2021-08-10T07:00:00Z"],"dc:date.created":["1992-01-01T08:00:00Z"],"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."],"dc:identifier":["https://openprairie.sdstate.edu/etd/5724"],"dc:language":["English"],"dc:subject":["Mathematics","Physical Sciences and Mathematics"],"dc:title":["Intelligent Search Under Uncertain Environments"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:02:40Z"}