Sciweavers

84 search results - page 12 / 17
» A Step Forward in Studying the Compact Genetic Algorithm
Sort
View
BMCBI
2007
143views more  BMCBI 2007»
13 years 6 months ago
Gene selection for classification of microarray data based on the Bayes error
Background: With DNA microarray data, selecting a compact subset of discriminative genes from thousands of genes is a critical step for accurate classification of phenotypes for, ...
Ji-Gang Zhang, Hong-Wen Deng
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 8 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
EUROPAR
2010
Springer
13 years 7 months ago
Ants in Parking Lots
Ants provide an attractive metaphor for robots that "cooperate" in performing complex tasks. What, however, are the algorithmic consequences of following this metaphor? ...
Arnold L. Rosenberg
TAPAS
2011
286views Algorithms» more  TAPAS 2011»
13 years 1 months ago
Alternative Route Graphs in Road Networks
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
13 years 11 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...