Maximizing over multiple pattern databases speeds up heuristic search (Q2457594): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5715685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing over multiple pattern databases speeds up heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint pattern database heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time complexity of iterative-deepening-\(A^{*}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{BIDA}^*\): An improved perimeter search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in permutation state spaces and the dual search algorithm / rank
 
Normal rank

Latest revision as of 11:39, 27 June 2024

scientific article
Language Label Description Also known as
English
Maximizing over multiple pattern databases speeds up heuristic search
scientific article

    Statements

    Maximizing over multiple pattern databases speeds up heuristic search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    0 references
    heuristic search
    0 references
    pattern databases
    0 references
    admissible heuristics
    0 references
    IDA*
    0 references
    0 references