Sciweavers

2626 search results - page 273 / 526
» The complexity of stochastic sequences
Sort
View
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
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 10 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
15 years 10 months ago
3D airspace sectoring by evolutionary computation: real-world applications
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
Daniel Delahaye, Stephane Puechmorel
CHARME
1997
Springer
105views Hardware» more  CHARME 1997»
15 years 10 months ago
Simulation-based verification of network protocols performance
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Pa...
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 ...