Sciweavers

240 search results - page 7 / 48
» The Tree Inclusion Problem: In Optimal Space and Faster
Sort
View
PPSN
2004
Springer
14 years 13 days ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
CEC
2009
IEEE
13 years 11 months ago
Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
Hemant K. Singh, Amitay Isaacs, Trung Thanh Nguyen...
ICML
2010
IEEE
13 years 8 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
EGC
2009
Springer
13 years 4 months ago
A Bayes Evaluation Criterion for Decision Trees
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
Nicolas Voisine, Marc Boullé, Carine Hue
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher