Sciweavers

775 search results - page 77 / 155
» Algorithm Selection via Ranking
Sort
View
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 8 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
ICML
2006
IEEE
14 years 9 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
EVOW
2009
Springer
14 years 3 months ago
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
STACS
2001
Springer
14 years 1 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
MIR
2006
ACM
145views Multimedia» more  MIR 2006»
14 years 2 months ago
Similarity learning via dissimilarity space in CBIR
In this paper, we introduce a new approach to learn dissimilarity for interactive search in content based image retrieval. In literature, dissimilarity is often learned via the fe...
Giang P. Nguyen, Marcel Worring, Arnold W. M. Smeu...