Sciweavers

1683 search results - page 91 / 337
» Local Selection
Sort
View
GECCO
2003
Springer
14 years 3 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
MP
2010
162views more  MP 2010»
13 years 8 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
14 years 3 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
BMCBI
2008
100views more  BMCBI 2008»
13 years 10 months ago
Hotspot Hunter: a computational system for large-scale screening and selection of candidate immunological hotspots in pathogen p
Background: T-cell epitopes that promiscuously bind to multiple alleles of a human leukocyte antigen (HLA) supertype are prime targets for development of vaccines and immunotherap...
Guanglan Zhang, Asif M. Khan, Kellathur N. Sriniva...
BMCBI
2005
121views more  BMCBI 2005»
13 years 10 months ago
Evaluation of gene importance in microarray data based upon probability of selection
Background: Microarray devices permit a genome-scale evaluation of gene function. This technology has catalyzed biomedical research and development in recent years. As many import...
Li M. Fu, Casey S. Fu-Liu