A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem (Q2468764): 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.1007/s10479-007-0229-6 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-007-0229-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992489324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating MAPs for belief networks is NP-hard and other theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bayesian method for the induction of probabilistic networks from data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Needed: An Empirical Science of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for SAT: an empirical evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PYTHIA-II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4438019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebra of bayesian belief universes for knowledge‐based systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical hardness models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated selection of mathematical software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of Presortedness and Optimal Sorting Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instance complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of heuristic optimization algorithms: A tutorial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3979383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-007-0229-6 / rank
 
Normal rank

Latest revision as of 20:09, 18 December 2024

scientific article
Language Label Description Also known as
English
A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
scientific article

    Statements

    A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem (English)
    0 references
    0 references
    0 references
    25 January 2008
    0 references
    0 references
    0 references
    0 references

    Identifiers