Utility of pathmax in partial order heuristic search

Information Processing Letters - Tập 55 - Trang 317-322 - 1995
Pallab Dasgupta1, P.P Chakrabarti1, S.C DeSarkar1
1Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur 721302, India

Tài liệu tham khảo

Bagchi, 1983, Search algorithms under different kinds of heuristics: A comparative study, J. ACM, 30, 1, 10.1145/322358.322359 Chakrabarti, 1989, Heuristic search in restricted memory, Artificial Intelligence, 41, 197, 10.1016/0004-3702(89)90010-6 Dechter, 1985, Generalized best-first search strategies and the optimality of a∗, J. ACM, 32, 505, 10.1145/3828.3830 Dasgupta, 1994, Multiobjective search in vlsi design, 395 Gelperin, 1977, On the optimality of a∗, Artificial Intelligence, 8, 69, 10.1016/0004-3702(77)90005-4 Martelli, 1977, On the complexity of admissible search algorithms, Artificial Intelligence, 8, 1, 10.1016/0004-3702(77)90002-9 Mero, 1984, A heuristic search algorithm with modifiable estimate, Artificial Intelligence, 23, 13, 10.1016/0004-3702(84)90003-1 Nilsson, 1980 Stewart, 1988, Heuristic search with a general order relation Stewart, 1991, Multiobjective a∗, J. ACM, 38, 775, 10.1145/115234.115368