Sciweavers

12950 search results - page 382 / 2590
» On Optimal Timed Strategies
Sort
View
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 8 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)Evolution-Strategies (ESs) with the aim of designing fast and robus...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
CCCG
2008
15 years 8 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
NIPS
2003
15 years 8 months ago
Decoding V1 Neuronal Activity using Particle Filtering with Volterra Kernels
Decoding is a strategy that allows us to assess the amount of information neurons can provide about certain aspects of the visual scene. In this study, we develop a method based o...
Ryan Kelly, Tai Sing Lee
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 8 months ago
An analysis of multi-sampled issue and no-replacement tournament selection
Standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised i...
Huayang Xie, Mengjie Zhang, Peter Andreae, Mark Jo...
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
15 years 8 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen