We present a novel way to judge the performance of IDA* heuristics. With this measure of heuristic quality η, different heuristics for the same problem space can be compared objectively without regards to a particular problem instance. We show how η can be used to model the performance expectations of PDB heuristics. By drawing histograms of the contributions of different parts of the search space to η, we show what parts are most critical to the quality of a heuristic and contribute to the long-standing question on what h values are most critical to the performance of an IDA* heuristic
Since the introduction of mathematical programming it has been all too easy to identify real-world p...
This paper summarizes recent analytical Inves-t igations of the mathematical properties of heuris t ...
Heuristic algorithms are often difficult to analyse theoretically; this holds in particular for adva...
International audienceBenchmarking aims to investigate the performance of one or several algorithms ...
This paper extends existing analyses of the performance of heuristic search in several directions. F...
We analyze the asymptotic time complexity of admis-sible heuristic search algorithms such as A*, IDA...
Many optimization problems in computer science have been proven to be NP-hard, and it is unlikely th...
This paper presents the Heuristic Quality Scale (HQS), an instrument designed to assess the quality ...
AbstractHeuristic search effectiveness depends directly upon the quality of heuristic evaluations of...
Efficient methods to find and retrieve stored information are a necessary and integral part of usefu...
The known NP-hardness results imply that for many combinatorial optimization problems there are no e...
Many optimization problems in computer science have been proven to be NP-hard, and it is unlikely th...
A model containing multiple optimal solutions and nonoptimal solutions is constructed to study the p...
Iterative-deepening-A* (IDA*) is an admissible heuristic search algorithm which is optimal with resp...
Many heuristic search methods have been derived by analogy from natural processes and applied to pra...
Since the introduction of mathematical programming it has been all too easy to identify real-world p...
This paper summarizes recent analytical Inves-t igations of the mathematical properties of heuris t ...
Heuristic algorithms are often difficult to analyse theoretically; this holds in particular for adva...
International audienceBenchmarking aims to investigate the performance of one or several algorithms ...
This paper extends existing analyses of the performance of heuristic search in several directions. F...
We analyze the asymptotic time complexity of admis-sible heuristic search algorithms such as A*, IDA...
Many optimization problems in computer science have been proven to be NP-hard, and it is unlikely th...
This paper presents the Heuristic Quality Scale (HQS), an instrument designed to assess the quality ...
AbstractHeuristic search effectiveness depends directly upon the quality of heuristic evaluations of...
Efficient methods to find and retrieve stored information are a necessary and integral part of usefu...
The known NP-hardness results imply that for many combinatorial optimization problems there are no e...
Many optimization problems in computer science have been proven to be NP-hard, and it is unlikely th...
A model containing multiple optimal solutions and nonoptimal solutions is constructed to study the p...
Iterative-deepening-A* (IDA*) is an admissible heuristic search algorithm which is optimal with resp...
Many heuristic search methods have been derived by analogy from natural processes and applied to pra...
Since the introduction of mathematical programming it has been all too easy to identify real-world p...
This paper summarizes recent analytical Inves-t igations of the mathematical properties of heuris t ...
Heuristic algorithms are often difficult to analyse theoretically; this holds in particular for adva...