Sciweavers

394 search results - page 15 / 79
» A framework for evolutionary optimization with approximate f...
Sort
View
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
14 years 1 months ago
Using Genetic Programming to Obtain a Closed-Form Approximation to a Recursive Function
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
Evan Kirshenbaum, Henri Jacques Suermondt
EMO
2009
Springer
140views Optimization» more  EMO 2009»
14 years 10 days ago
On Using Populations of Sets in Multiobjective Optimization
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
Johannes Bader, Dimo Brockhoff, Samuel Welten, Eck...
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 8 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 5 months ago
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
Per Kristian Lehre, Xin Yao