Sciweavers

218 search results - page 23 / 44
» Quantum-inspired evolutionary algorithm for a class of combi...
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 7 days ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
GECCO
2003
Springer
14 years 1 months ago
Generative Representations for Evolving Families of Designs
Abstract. Since typical evolutionary design systems encode only a single artifact with each individual, each time the objective changes a new set of individuals must be evolved. Wh...
Gregory Hornby
COLT
2004
Springer
14 years 10 days ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 9 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ICCV
2011
IEEE
12 years 8 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter