Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2009.07.004 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2009.07.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153806142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AND/OR branch-and-bound search for combinatorial optimization in graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive conditioning / 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: A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mini-buckets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-First AND/OR Search for 0/1 Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying tree decompositions for reasoning in graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: AND/OR search spaces for graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket elimination: A unifying framework for reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory intensive AND/OR search for combinatorial optimization in graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided local search for solving SAT and weighted MAX-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution versus search: Two strategies for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earth observation satellite management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling relational Bayesian networks for exact inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic search in restricted memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-space best-first search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2009.07.004 / rank
 
Normal rank

Latest revision as of 14:54, 10 December 2024

scientific article
Language Label Description Also known as
English
Memory intensive AND/OR search for combinatorial optimization in graphical models
scientific article

    Statements

    Memory intensive AND/OR search for combinatorial optimization in graphical models (English)
    0 references
    0 references
    0 references
    21 December 2009
    0 references
    search
    0 references
    AND/OR search
    0 references
    decomposition
    0 references
    graphical models
    0 references
    Bayesian networks
    0 references
    constraint networks
    0 references
    constraint optimization
    0 references

    Identifiers