A method for computing heuristics in problem solving
From MaRDI portal
Publication:1143823
DOI10.1016/0020-0255(79)90024-0zbMath0442.68097OpenAlexW2071730763MaRDI QIDQ1143823
Marco Somalvico, Giovanni Guida
Publication date: 1979
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(79)90024-0
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Network-based heuristics for constraint-satisfaction problems, A new result on the complexity of heuristic estimates for the \(A^*\) algorithm, A framework for analysing state-abstraction methods, A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of admissible search algorithms
- Semantics in problem representation and search
- An integrated model of problem solver
- Heuristically guided search and chromosome matching
- Heuristic search viewed as path finding in a graph
- An admissible and optimal algorithm for searching AND/OR graphs
- Sufficient Conditions for the Success of GPS
- A Note on Dijkstra's Shortest Path Algorithm
