Sciweavers

58 search results - page 6 / 12
» Graph-based quadratic optimization: A fast evolutionary appr...
Sort
View
ANOR
2011
117views more  ANOR 2011»
12 years 11 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
PAMI
2007
113views more  PAMI 2007»
13 years 7 months ago
Dominant Sets and Pairwise Clustering
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
Massimiliano Pavan, Marcello Pelillo
DATESO
2007
157views Database» more  DATESO 2007»
13 years 9 months ago
Index-Based Approach to Similarity Search in Protein and Nucleotide Databases
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
David Hoksza, Tomás Skopal
EMO
2006
Springer
87views Optimization» more  EMO 2006»
13 years 11 months ago
Symbolic Archive Representation for a Fast Nondominance Test
Abstract. Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense ...
Martin Lukasiewycz, Michael Glaß, Christian ...
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolving hash functions by means of genetic programming
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
César Estébanez, Julio César ...