PALO: a probabilistic hill-climbing algorithm (Q2171267): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127642480, #quickstatements; #temporary_batch_1722545075506
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: C4.5 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0004-3702(95)00040-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031355581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3493324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3200589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3493259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimal derivation strategies in redundant knowledge bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probably approximately optimal satisficing strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifying inductive bias: AI learning algorithms and Valiant's learning framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory refinement combining analytical and empirical methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Default reasoning in semantic networks: A formalization of recognition and inheritance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal problem-solving search: All-or-none solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlling backward inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127642480 / rank
 
Normal rank

Latest revision as of 22:46, 1 August 2024

scientific article
Language Label Description Also known as
English
PALO: a probabilistic hill-climbing algorithm
scientific article

    Statements

    PALO: a probabilistic hill-climbing algorithm (English)
    0 references
    0 references
    23 September 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    computational learning theory
    0 references
    hill-climbing
    0 references
    speed-up learning
    0 references
    utility problem
    0 references
    knowledge compilation
    0 references
    theory revision
    0 references
    prioritized default theories
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references