Sciweavers

529 search results - page 67 / 106
» The Optimal Fixed Point Combinator
Sort
View
161
Voted
ICALP
2003
Springer
15 years 9 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
ATMOS
2007
163views Optimization» more  ATMOS 2007»
15 years 5 months ago
Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
Ingmar Steinzen, Leena Suhl, Natalia Kliewer
GECCO
2009
Springer
188views Optimization» more  GECCO 2009»
15 years 7 months ago
Exploiting multiple classifier types with active learning
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
Zhenyu Lu, Josh Bongard
144
Voted
CVPR
2010
IEEE
15 years 4 months ago
GPCA with denoising: A moments-based convex approach
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
Necmiye Ozay, Mario Sznaier, Constantino M. Lagoa,...
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 5 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...