A general scheme for automatic generation of search heuristics from specification dependencies
β Scribed by Kalev Kask; Rina Dechter
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 396 KB
- Volume
- 129
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
β¦ Synopsis
The paper presents and evaluates the power of a new scheme that generates search heuristics mechanically for problems expressed using a set of functions or relations over a finite set of variables. The heuristics are extracted from a parameterized approximation scheme called Mini-Bucket elimination that allows controlled trade-off between computation and accuracy. The heuristics are used to guide Branch-and-Bound and Best-First search. Their performance is compared on two optimization tasks: the Max-CSP task defined on deterministic databases and the Most Probable Explanation task defined on probabilistic databases. Benchmarks were random data sets as well as applications to coding and medical diagnosis problems. Our results demonstrate that the heuristics generated are effective for both search schemes, permitting controlled trade-off between preprocessing (for heuristic generation) and search.
π SIMILAR VOLUMES
A theoretical scheme is presented for generating Gazeau-Klauder coherent states (GKCSs) via the generalization of degenerate Raman interaction with coupling constant to intensity dependent coupling. Firstly, we prove that in the intensity dependent degenerate Raman interaction, under particular cond
A general purpose model and a flexible computer program, called SEGPATH, have been developed to assist in the creation and implementation of a variety of genetic epidemiological models. SEGPATH is a computer program which can be used to generate programs to implement linear models for pedigree data,