Sciweavers

213 search results - page 20 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
JAIR
2011
173views more  JAIR 2011»
14 years 17 days ago
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
J. Hoffmann
IEAAIE
1994
Springer
15 years 1 months ago
Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
JMLR
2006
145views more  JMLR 2006»
14 years 9 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
CIKM
1999
Springer
15 years 1 months ago
Rule-Based Query Optimization, Revisited
We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a general-purpose active-database rule language embedded in C+...
Lane Warshaw, Daniel P. Miranker
72
Voted
GECCO
2005
Springer
100views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolutionary tree genetic programming
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
Ján Antolík, William H. Hsu