Sciweavers

6095 search results - page 968 / 1219
» Learning in Local Search
Sort
View
LCTRTS
2004
Springer
15 years 11 months ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...
GECCO
2003
Springer
15 years 11 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
GECCO
2010
Springer
237views Optimization» more  GECCO 2010»
15 years 11 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noiseless BBOB-2010 testbed
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 10 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
DILS
2006
Springer
15 years 10 months ago
An Extensible Light-Weight XML-Based Monitoring System for Sequence Databases
Life science researchers want biological information in their interest to become available to them as soon as possible. A monitoring system is a solution that relieves biologists f...
Dieter Van de Craen, Frank Neven, Kerstin Koch