OPTIMAL TUNNELING: A HEURISTIC FOR LEARNING MACROS
| dc.contributor.author | James, Mark | eng |
| dc.contributor.author | MacDonald, Bruce | eng |
| dc.date.accessioned | 2008-02-26T22:38:40Z | |
| dc.date.available | 2008-02-26T22:38:40Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1993-03-01 | eng |
| dc.description.abstract | This paper presents the Optimal Tunneling heuristic for learning macro operators. Optimal Tunneling produces shorter more useful macros than the similar Minimum to Minimum heuristic presented by Iba. Optimal Tunneling is arguably an improvement since its macros (a) best reduce search cost, (b) give the most accurate modification to the search space to make the heuristic function correct, and (c) result in better performance on comparative tests. Optimal Tunneling creates macros that cross exactly the expensive segment of the heuristic function along the current solution path. A water pouring analogy is proposed to illustrate the effect of macros on the cost of search in problem solving. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1993-510-15 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30893 | |
| dc.identifier.uri | http://hdl.handle.net/1880/45582 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | OPTIMAL TUNNELING: A HEURISTIC FOR LEARNING MACROS | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |