Sciweavers

536 search results - page 70 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
UAI
2003
13 years 9 months ago
Bayesian Hierarchical Mixtures of Experts
The Hierarchical Mixture of Experts (HME) is a well-known tree-structured model for regression and classification, based on soft probabilistic splits of the input space. In its o...
Christopher M. Bishop, Markus Svensén
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
13 years 9 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
CEC
2010
IEEE
13 years 9 months ago
Improving GP classification performance by injection of decision trees
This paper presents a novel hybrid method combining genetic programming and decision tree learning. The method starts by estimating a benchmark level of reasonable accuracy, based ...
Rikard König, Ulf Johansson, Tuve Löfstr...
CDC
2008
IEEE
228views Control Systems» more  CDC 2008»
14 years 3 months ago
Stability analysis for neural networks with time-varying delay
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
Xun-Lin Zhu, Guang-Hong Yang
DCC
2005
IEEE
14 years 8 months ago
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
Pascale Charpin, Enes Pasalic