Sciweavers

2914 search results - page 318 / 583
» Optimization by Stochastic Continuation
Sort
View
ICML
2006
IEEE
16 years 7 months ago
A DC-programming algorithm for kernel selection
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
EWCBR
2004
Springer
15 years 10 months ago
MINLP Based Retrieval of Generalized Cases
The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design au...
Alexander Tartakovski, Martin Schaaf, Rainer Maxim...
CP
2009
Springer
16 years 1 months ago
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
Serdar Kadioglu, Meinolf Sellmann
EMO
2009
Springer
159views Optimization» more  EMO 2009»
16 years 1 months ago
Recombination for Learning Strategy Parameters in the MO-CMA-ES
The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) is a variable-metric algorithm for real-valued vector optimization. It maintains a parent population...
Thomas Voß, Nikolaus Hansen, Christian Igel
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
16 years 1 months ago
Geometric differential evolution
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Julian Togelius