{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-1095"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-1095","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Experiential Analysis of Heuristic Search Algorithms","abstract":"Efficient methods to find and retrieve stored information are a necessary and integral part of useful and responsive computer systems. Algorithms responsible for this task are called search algorithms. Heuristic search techniques are an important subset of the search algorithms because of the minimum amount of time they need to find a solution. Their one drawback is the fact that they may not find the optimal solution. This limits their applicability but they remain a viable alternative for many problem spaces, particularly where the search solution's quality is relative rather than absolute, as is the case in typical Artificial Intelligence applications. In this thesis, the performance characteristics of several heuristic search techniques are investigated and compared. By observing these proposed heuristic search methods in action on a given problem space, an attempt is made to develop a feel for the \"quality\" of the solutions found by such methods. In other words, what is the mean ranking of a solution found by these techniques? Can we be sure that the solution is better than average? How can the quality of the solution be increased?","abstract_html":"Efficient methods to find and retrieve stored information are a necessary and integral part of useful and responsive computer systems. Algorithms responsible for this task are called search algorithms. Heuristic search techniques are an important subset of the search algorithms because of the minimum amount of time they need to find a solution. Their one drawback is the fact that they may not find the optimal solution. This limits their applicability but they remain a viable alternative for many problem spaces, particularly where the search solution&#x27;s quality is relative rather than absolute, as is the case in typical Artificial Intelligence applications. In this thesis, the performance characteristics of several heuristic search techniques are investigated and compared. By observing these proposed heuristic search methods in action on a given problem space, an attempt is made to develop a feel for the &quot;quality&quot; of the solutions found by such methods. In other words, what is the mean ranking of a solution found by these techniques? Can we be sure that the solution is better than average? How can the quality of the solution be increased?","abstract_has_math":false,"creators":["Wolterstorff, Steve"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","degree_discipline":"Computer Science","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:03:11Z","subjects":["Computer Sciences","Physical Sciences and Mathematics"],"languages":["English"],"rights":[],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd2/96","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/96","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%3Aetd2-1095","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bin Cong"]},{"key":"dc:creator","label":"Author","values":["Wolterstorff, Steve"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-10-29T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["1994-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"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":["Computer Sciences","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd2/96"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Efficient methods to find and retrieve stored information are a necessary and integral part of useful and responsive computer systems. Algorithms responsible for this task are called search algorithms. Heuristic search techniques are an important subset of the search algorithms because of the minimum amount of time they need to find a solution. Their one drawback is the fact that they may not find the optimal solution. This limits their applicability but they remain a viable alternative for many problem spaces, particularly where the search solution's quality is relative rather than absolute, as is the case in typical Artificial Intelligence applications. In this thesis, the performance characteristics of several heuristic search techniques are investigated and compared. By observing these proposed heuristic search methods in action on a given problem space, an attempt is made to develop a feel for the \"quality\" of the solutions found by such methods. In other words, what is the mean ranking of a solution found by these techniques? Can we be sure that the solution is better than average? How can the quality of the solution be increased?"]},{"key":"dc:title","label":"Title","values":["Experiential Analysis of Heuristic Search Algorithms"]}]}],"canonical_facts":{"dc:contributor":["Bin Cong"],"dc:creator":["Wolterstorff, Steve"],"dc:date.available":["2021-10-29T07:00:00Z"],"dc:date.created":["1994-01-01T08:00:00Z"],"dc:description.abstract":["Efficient methods to find and retrieve stored information are a necessary and integral part of useful and responsive computer systems. Algorithms responsible for this task are called search algorithms. Heuristic search techniques are an important subset of the search algorithms because of the minimum amount of time they need to find a solution. Their one drawback is the fact that they may not find the optimal solution. This limits their applicability but they remain a viable alternative for many problem spaces, particularly where the search solution's quality is relative rather than absolute, as is the case in typical Artificial Intelligence applications. In this thesis, the performance characteristics of several heuristic search techniques are investigated and compared. By observing these proposed heuristic search methods in action on a given problem space, an attempt is made to develop a feel for the \"quality\" of the solutions found by such methods. In other words, what is the mean ranking of a solution found by these techniques? Can we be sure that the solution is better than average? How can the quality of the solution be increased?"],"dc:identifier":["https://openprairie.sdstate.edu/etd2/96"],"dc:language":["English"],"dc:rights":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Computer Sciences","Physical Sciences and Mathematics"],"dc:title":["Experiential Analysis of Heuristic Search Algorithms"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T09:03:11Z"}