Sciweavers

29 search results - page 5 / 6
» Test Case Generation According to the Binary Search Strategy
Sort
View
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
14 years 2 months ago
Addressing sampling errors and diversity loss in UMDA
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model....
Jürgen Branke, Clemens Lode, Jonathan L. Shap...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 2 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
ICANN
2005
Springer
14 years 1 months ago
Evolution of Heuristics for Give-Away Checkers
The efficacy of two evolutionary approaches to the problem of generation of heuristical linear and non-linear evaluation functions in the game of give-away checkers is tested in th...
Magdalena Kusiak, Karol Waledzik, Jacek Mandziuk
BMCBI
2010
175views more  BMCBI 2010»
13 years 8 months ago
Calibur: a tool for clustering large numbers of protein decoys
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
Shuai Cheng Li, Yen Kaow Ng
NLP
2000
13 years 12 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman