Sciweavers

639 search results - page 58 / 128
» Comparative analysis of genetic algorithm implementations
Sort
View
BMCBI
2010
89views more  BMCBI 2010»
13 years 7 months ago
Spatial normalization improves the quality of genotype calling for Affymetrix SNP 6.0 arrays
Background: Microarray measurements are susceptible to a variety of experimental artifacts, some of which give rise to systematic biases that are spatially dependent in a unique w...
High-Seng Chai, Terry M. Therneau, Kent R. Bailey,...
ICCAD
2004
IEEE
180views Hardware» more  ICCAD 2004»
14 years 4 months ago
Physical placement driven by sequential timing analysis
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
Aaron P. Hurst, Philip Chong, Andreas Kuehlmann
SCAM
2008
IEEE
14 years 2 months ago
Aspect-Aware Points-to Analysis
Points-to analysis is a fundamental analysis technique whose results are useful in compiler optimization and software engineering tools. Although many points-to analysis algorithm...
Qiang Sun, Jianjun Zhao
CCE
2005
13 years 7 months ago
Computer-aided molecular design using Tabu search
A detailed implementation of the Tabu Search (TS) algorithm for computer-aided molecular design (CAMD) of transition metal catalysts is presented in this paper. Previous CAMD rese...
Bao Lin, Sunitha Chavali, Kyle V. Camarda, David C...
SAC
2006
ACM
13 years 7 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen