A solution to the GHI problem for best-first search (Q1589511)

From MaRDI portal
Revision as of 16:59, 31 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126635197, #quickstatements; #temporary_batch_1722437626092)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A solution to the GHI problem for best-first search
scientific article

    Statements

    title
    A solution to the GHI problem for best-first search (English)
    0 references
    author
    D. M. Breuker
    0 references
    H. Jaap van den Herik
    0 references
    Jos W. H. M. Uiterwijk
    0 references
    L. Victor Allis
    0 references
    publication date
    12 December 2000
    0 references
    zbMATH DE Number
    1542312
    0 references
    zbMATH Keywords
    graph-history interaction problem
    0 references
    best-first search
    0 references
    base-twin algorithm
    0 references
    Wikidata QID
    Q126635197
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1589511&oldid=37496723"
    Powered by MediaWiki