Characterizing Search Spaces
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Planning and Search. Pages 780-781.
Abstract
A heuristic is good on a search space to the extent that it allows 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 heuri stic on a given search space. Themeasure sheds light on characteristics of the Traveling Salesman Problem that make it computationally mor e difficult to solve than the Minimum Spanning-Tree Problem.
Roy Rada. 1983. Characterizing Search Spaces. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83. IJCAI, 780–781. https://ijcai.org/proceedings/1983/189
Rada, R. (1983). Characterizing Search Spaces. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 (pp. 780–781). IJCAI. https://ijcai.org/proceedings/1983/189
@inproceedings{ijcai1983p189,
title = {Characterizing Search Spaces},
author = {Rada, Roy},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {780--781},
year = {1983},
note = {Planning and Search},
url = {https://ijcai.org/proceedings/1983/189},
}
TY - CPAPER TI - Characterizing Search Spaces AU - Rada, Roy T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 780 EP - 781 UR - https://ijcai.org/proceedings/1983/189 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
