Sciweavers

3244 search results - page 202 / 649
» On convex complexity measures
Sort
View
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 10 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
CEC
2007
IEEE
15 years 10 months ago
Efficient relevance estimation and value calibration of evolutionary algorithm parameters
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
Volker Nannen, A. E. Eiben
RECOMB
2000
Springer
15 years 10 months ago
Using Bayesian networks to analyze expression data
DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a "snapshot" of transcription levels within the c...
Nir Friedman, Michal Linial, Iftach Nachman, Dana ...
IJCAI
2007
15 years 8 months ago
Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters
— Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. ...
Volker Nannen, A. E. Eiben
COMPGEOM
1987
ACM
15 years 10 months ago
Simplified Voronoi Diagrams
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...
John F. Canny, Bruce Randall Donald