Sciweavers

873 search results - page 92 / 175
» Rates of convergence for Quicksort
Sort
View
KES
2005
Springer
15 years 11 months ago
Towards Adaptive Clustering in Self-monitoring Multi-agent Networks
A Decentralised Adaptive Clustering (DAC) algorithm for self-monitoring impact sensing networks is presented within the context of CSIRO-NASA Ageless Aerospace Vehicle project. DAC...
Piraveenan Mahendra rajah, Mikhail Prokopenko, Pet...
ICASSP
2009
IEEE
15 years 10 months ago
Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
Ziad Naja, Florence Alberge, Pierre Duhamel
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
15 years 10 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng
AAAI
2006
15 years 7 months ago
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Yang Yu, Zhi-Hua Zhou
WSC
2004
15 years 7 months ago
Optimal Computing Budget Allocation Under Correlated Sampling
We consider the optimal computing budget allocation (OCBA) problem where the simulated designs are correlated. The exact optimal allocation is presented for two designs, and an ap...
Michael C. Fu, Jian-Qiang Hu, Chun-Hung Chen, Xiao...