Sciweavers

101 search results - page 16 / 21
» Fast Comparison of Evolutionary Trees
Sort
View
DAC
2003
ACM
14 years 8 months ago
Improved global routing through congestion estimation
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
Raia Hadsell, Patrick H. Madden
ICPR
2010
IEEE
13 years 5 months ago
Local Jet Based Similarity for NL-Means Filtering
Reducing the dimension of local descriptors in images is useful to perform pixels comparison faster. We show here that, for enhancing and optimising the computation of the NL-mean...
Antoine Manzanera
BIOINFORMATICS
2010
138views more  BIOINFORMATICS 2010»
13 years 7 months ago
Robust unmixing of tumor states in array comparative genomic hybridization data
Motivation: Tumorigenesis is an evolutionary process by which tumor cells acquire sequences of mutations leading to increased growth, invasiveness, and eventually metastasis. It i...
David Tolliver, Charalampos E. Tsourakakis, Ayshwa...
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
13 years 11 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
IWCLS
2007
Springer
14 years 1 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull