Sciweavers

292 search results - page 57 / 59
» Evolutionary Algorithms for Two Problems from the Calculus o...
Sort
View
GECCO
2003
Springer
13 years 12 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
PG
2007
IEEE
14 years 29 days ago
Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps
We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its g...
Janine Bennett, Valerio Pascucci, Kenneth I. Joy
ALT
2009
Springer
14 years 3 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
CCR
2004
157views more  CCR 2004»
13 years 6 months ago
Designing BGP-based outbound traffic engineering techniques for stub ASes
Today, most multi-connected autonomous systems (AS) need to control the flow of their interdomain traffic for both performance and economical reasons. This is usually done by manu...
Steve Uhlig, Olivier Bonaventure
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 1 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai