The Preprocessing of Search Spaces for Branch and Bound Search.

dc.contributor.authorYang, Q.en_US
dc.contributor.authorNau, D.S.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:41:56Z
dc.date.available2007-05-23T09:41:56Z
dc.date.issued1988en_US
dc.description.abstractHeuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time, expanding some paths more quickly than others depending on which paths look most promising. Often large amounts of time are required in keeping track of the information control knowledge. For some problems, this overhead can be greatly reduced by preprocessing the problem in appropriate ways. In particular, we discuss a data structure called a threaded decision graph, which can be created by preprocessing the search space for some problems, and which captures the control knowledge for problem solving. We show how this can be done, and we present an analysis showing that by using such a method, a great deal of time can be saved during problem solving processes.en_US
dc.format.extent2234173 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4800
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1988-74en_US
dc.titleThe Preprocessing of Search Spaces for Branch and Bound Search.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_88-74.pdf
Size:
2.13 MB
Format:
Adobe Portable Document Format