Sciweavers

240 search results - page 11 / 48
» Using Distance Estimates in Heuristic Search
Sort
View
BMCBI
2005
100views more  BMCBI 2005»
13 years 7 months ago
Scoredist: A simple and robust protein sequence distance estimator
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
Erik L. L. Sonnhammer, Volker Hollich
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
12 years 11 months ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
EC
2007
167views ECommerce» more  EC 2007»
13 years 7 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
GIS
2008
ACM
13 years 8 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
HEURISTICS
2002
65views more  HEURISTICS 2002»
13 years 7 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...