Sciweavers

49 search results - page 9 / 10
» Two Remarkable Computational Competencies of the Simple Gene...
Sort
View
DAGSTUHL
2006
14 years 11 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
RECOMB
2004
Springer
15 years 10 months ago
A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs
The prediction of translation initiation sites (TISs) in eukaryotic mRNAs has been a challenging problem in computational molecular biology. In this paper, we present a new algori...
Haifeng Li, Tao Jiang
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 2 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
CVPR
2001
IEEE
15 years 11 months ago
Automatic Partitioning of High Dimensional Search Spaces Associated with Articulated Body Motion Capture
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
Jonathan Deutscher, Andrew J. Davison, Ian D. Reid
CF
2010
ACM
15 years 2 months ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross