Optimal competence set expansion using deduction graphs (Q1321446)

From MaRDI portal
Revision as of 15:16, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal competence set expansion using deduction graphs
scientific article

    Statements

    title
    Optimal competence set expansion using deduction graphs (English)
    0 references
    DOI
    10.1007/BF02196594
    0 references
    author
    V. Pereyra
    0 references
    publication date
    25 July 1994
    0 references
    Mathematics Subject Classification ID
    91B06
    0 references
    90C90
    0 references
    90C09
    0 references
    zbMATH DE Number
    557917
    0 references
    zbMATH Keywords
    branch-and-bound
    0 references
    deduction graphs
    0 references
    habitual domains
    0 references
    competence set
    0 references
    minimum spanning tree
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1321446&oldid=34123327"
    Powered by MediaWiki