Sciweavers

2071 search results - page 200 / 415
» An Empirical Evaluation of LFG-DOP
Sort
View
IJCAI
1997
15 years 2 months ago
Hidden Gold in Random Generation of SAT Satisfiable Instances
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
Thierry Castell, Michel Cayrol
UAI
2000
15 years 2 months ago
Adaptive Importance Sampling for Estimation in Structured Domains
Sampling is an important tool for estimating large, complex sums and integrals over highdimensional spaces. For instance, importance sampling has been used as an alternative to ex...
Luis E. Ortiz, Leslie Pack Kaelbling
AAAI
1994
15 years 2 months ago
Dead-End Driven Learning
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
Daniel Frost, Rina Dechter
IJCAI
1993
15 years 2 months ago
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Usama M. Fayyad, Keki B. Irani
IJCAI
1993
15 years 2 months ago
An Inductive Approach to Learning Search Control Rules for Planning
One method for reducing the time required for plan generation is to learn search control rules from experience. Most of the recent work in learning search control knowledge has co...
Christopher Leckie, Ingrid Zukerman