Characterizing Search Spaces

Simple item page
dc.contributor.authorRada, Roy
dc.date.accessioned2020-11-13T18:46:41Z
dc.date.available2020-11-13T18:46:41Z
dc.description.abstractA heuristic is good on a search space to the extent that it llows the prediction of which states are near to the goal. In this paper heuristics are investigated on several different search spaces. A measure is proposed for assessing the predictive accuracy of a given heuristic on a given search space. The measure sheds light on characteristics of the Traveling Salesman Problem that make it computationally more difficult to solve than the Minimum Spanning-Tree Problem.en_US
dc.description.sponsorshipThanks to the referees and graduate student Ching-Chio Sheu.en_US
dc.description.urihttps://www.ijcai.org/Proceedings/83-2/Papers/045.pdfen_US
dc.format.extent3 pagesen_US
dc.genreconference papers and proceedingsen_US
dc.identifierdoi:10.13016/m2raz4-wzes
dc.identifier.citationRoy Rada, Characterizing Search Spaces, https://www.ijcai.org/Proceedings/83-2/Papers/045.pdfen_US
dc.identifier.urihttp://hdl.handle.net/11603/20059
dc.language.isoen_USen_US
dc.publisherIJCAIen_US
dc.relation.isAvailableAtThe University of Maryland, Baltimore County (UMBC)
dc.relation.ispartofUMBC Information Systems Department Collection
dc.rightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
dc.subjectmathen_US
dc.subjectsearch spaceen_US
dc.subjectheuristicsen_US
dc.titleCharacterizing Search Spacesen_US
dc.typeTexten_US

Files

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.56 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

UMBC Information Systems Department