PALO: a probabilistic hill-climbing algorithm
- 1 July 1996
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 84 (1-2) , 177-208
- https://doi.org/10.1016/0004-3702(95)00040-2
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Learning to select useful landmarksIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Finding optimal derivation strategies in redundant knowledge basesArtificial Intelligence, 1991
- Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation servicesArtificial Intelligence, 1991
- Explanation-based learning:A problem solving perspectiveArtificial Intelligence, 1989
- Default reasoning in semantic networks: A formalization of recognition and inheritanceArtificial Intelligence, 1989
- Controlling backward inferenceArtificial Intelligence, 1989
- Nonmonotonic ReasoningAnnual Review of Computer Science, 1987
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Optimization by Simulated AnnealingScience, 1983
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963