1158 search results - page 108 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
140
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Coevolution has often been based on averaged outcomes, resulting in unstable evaluation. Several theoretical approaches have used archives to provide stable evaluation. However, t...
258
Voted
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
190
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
183
click to vote
IPCO
2007
15 years 7 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
136
click to vote
ESANN
2000
15 years 7 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...