Sciweavers

895 search results - page 59 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
13 years 1 months ago
Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
Junfeng Zhou, Zhifeng Bao, Wei Wang, Tok Wang Ling...
68
Voted
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 5 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
ICTAI
1993
IEEE
15 years 3 months ago
Robust Feature Selection Algorithms
Selecting a set of features which is optimal for a given task is a problem which plays an important role in a wide variety of contexts including pattern recognition, adaptive cont...
Haleh Vafaie, Kenneth DeJong
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
15 years 2 months ago
Discrimination of metabolic flux profiles using a hybrid evolutionary algorithm
Studying metabolic fluxes is a crucial aspect of understanding biological phenotypes. However, it is often not possible to measure these fluxes directly. As an alternative, fluxom...
Stefan Bleuler, Eckart Zitzler
JAL
2006
175views more  JAL 2006»
14 years 11 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin