Effective use of memory in iterative deepening search (Q1198022): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import recommendations run Q6767936
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three approaches to heuristic search in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic search in restricted memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing search efficiency using multiple heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized best-first search strategies and the optimality of A* / 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: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Q4460711 / rank
 
Normal rank
Property / Recommended article: Q4460711 / qualifier
 
Similarity Score: 0.8314111
Amount0.8314111
Unit1
Property / Recommended article: Q4460711 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Heuristic search in restricted memory / rank
 
Normal rank
Property / Recommended article: Heuristic search in restricted memory / qualifier
 
Similarity Score: 0.8254627
Amount0.8254627
Unit1
Property / Recommended article: Heuristic search in restricted memory / qualifier
 
Property / Recommended article
 
Property / Recommended article: Efficient retrieval from sparse associative memory / rank
 
Normal rank
Property / Recommended article: Efficient retrieval from sparse associative memory / qualifier
 
Similarity Score: 0.8229511
Amount0.8229511
Unit1
Property / Recommended article: Efficient retrieval from sparse associative memory / qualifier
 
Property / Recommended article
 
Property / Recommended article: Memory and Learning in Metaheuristics / rank
 
Normal rank
Property / Recommended article: Memory and Learning in Metaheuristics / qualifier
 
Similarity Score: 0.8226948
Amount0.8226948
Unit1
Property / Recommended article: Memory and Learning in Metaheuristics / qualifier
 
Property / Recommended article
 
Property / Recommended article: Learning for efficient search / rank
 
Normal rank
Property / Recommended article: Learning for efficient search / qualifier
 
Similarity Score: 0.81871504
Amount0.81871504
Unit1
Property / Recommended article: Learning for efficient search / qualifier
 
Property / Recommended article
 
Property / Recommended article: Iterative Deepening Dynamically Improved Bounds Bidirectional Search / rank
 
Normal rank
Property / Recommended article: Iterative Deepening Dynamically Improved Bounds Bidirectional Search / qualifier
 
Similarity Score: 0.81604743
Amount0.81604743
Unit1
Property / Recommended article: Iterative Deepening Dynamically Improved Bounds Bidirectional Search / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3108908 / rank
 
Normal rank
Property / Recommended article: Q3108908 / qualifier
 
Similarity Score: 0.81567305
Amount0.81567305
Unit1
Property / Recommended article: Q3108908 / qualifier
 

Latest revision as of 12:17, 4 April 2025

scientific article
Language Label Description Also known as
English
Effective use of memory in iterative deepening search
scientific article

    Statements

    Effective use of memory in iterative deepening search (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    \(IDA^*\)
    0 references
    tree search
    0 references
    approximation algorithm
    0 references
    \(A^*\)
    0 references
    flow-shop scheduling problem
    0 references

    Identifiers