Sciweavers

1041 search results - page 161 / 209
» Randomizing Reductions of Search Problems
Sort
View
ECOOP
2007
Springer
13 years 11 months ago
Efficiently Generating Structurally Complex Inputs with Thousands of Objects
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
Bassem Elkarablieh, Yehia Zayour, Sarfraz Khurshid
GECCO
2008
Springer
324views Optimization» more  GECCO 2008»
13 years 8 months ago
Convergence behavior of the fully informed particle swarm optimization algorithm
The fully informed particle swarm optimization algorithm (FIPS) is very sensitive to changes in the population topology. The velocity update rule used in FIPS considers all the ne...
Marco Antonio Montes de Oca, Thomas Stützle
ICASSP
2010
IEEE
13 years 8 months ago
Discriminative template extraction for direct modeling
This paper addresses the problem of developing appropriate features for use in direct modeling approaches to speech recognition, such as those based on Maximum Entropy models or S...
Shankar Shivappa, Patrick Nguyen, Geoffrey Zweig
PRL
2007
180views more  PRL 2007»
13 years 7 months ago
Feature selection based on rough sets and particle swarm optimization
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
Xiangyang Wang, Jie Yang, Xiaolong Teng, Weijun Xi...
BMCBI
2006
113views more  BMCBI 2006»
13 years 7 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida