Sciweavers

1725 search results - page 246 / 345
» Relaxed genetic programming
Sort
View
PLDI
2010
ACM
15 years 3 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
LICS
2002
IEEE
15 years 2 months ago
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
Sophie Laplante, Richard Lassaigne, Fréd&ea...
BMCBI
2010
151views more  BMCBI 2010»
14 years 10 months ago
CCRaVAT and QuTie - enabling analysis of rare variants in large-scale case control and quantitative trait association studies
Background: Genome-wide association studies have been successful in finding common variants influencing common traits. However, these associations only account for a fraction of t...
Robert Lawrence, Aaron G. Day-Williams, Katherine ...
BMCBI
2008
125views more  BMCBI 2008»
14 years 10 months ago
SNPLims: a data management system for genome wide association studies
Background: Recent progresses in genotyping technologies allow the generation high-density genetic maps using hundreds of thousands of genetic markers for each DNA sample. The ava...
Alessandro Orro, Guia Guffanti, Erika Salvi, Fabio...
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 4 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki