Sciweavers

3049 search results - page 186 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CEC
2010
IEEE
15 years 4 months ago
Comparison of GA and PSO performance in parameter estimation of microbial growth models: A case-study using experimental data
In this work we examined the performance of two evolutionary algorithms, a genetic algorithm (GA) and particle swarm optimization (PSO), in the estimation of the parameters of a mo...
Dulce Calcada, Agostinho Rosa, Luis C. Duarte, Vit...
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
15 years 6 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
IOR
2010
92views more  IOR 2010»
15 years 4 months ago
Series Expansions for Continuous-Time Markov Processes
We present exchange formulas that allow to express the stationary distribution of a continuous Markov chain with denumerable state-space having generator matrix Q∗ through a con...
Bernd Heidergott, Arie Hordijk, Nicole Leder
FOCS
2002
IEEE
15 years 11 months ago
Testing Juntas
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra...
ICIC
2005
Springer
15 years 12 months ago
A Sequential Niching Technique for Particle Swarm Optimization
This paper proposed a modified algorithm, sequential niching particle swarm optimization (SNPSO), for the attempt to get multiple maxima of multimodal function. Based on the sequen...
Jun Zhang, Jing-Ru Zhang, Kang Li