A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible heuristic search in AND/OR graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The art and theory of dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming as Graph Searching: An Algebraic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between AND/OR graphs and context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvable classes of discrete dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: AND/OR graph heuristic search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing decision trees through heuristically guided search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Strategies for Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: General branch and bound, and its relation to \(A^*\) and \(AO^*\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax algorithm better than alpha-beta? / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space problem-reduction, and theorem proving—some relationships / rank
 
Normal rank

Latest revision as of 14:12, 21 June 2024

scientific article
Language Label Description Also known as
English
A general heuristic bottom-up procedure for searching AND/OR graphs
scientific article

    Statements

    A general heuristic bottom-up procedure for searching AND/OR graphs (English)
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    heuristic bottom-up procedure
    0 references
    AND/OR graph
    0 references