Sciweavers

2900 search results - page 95 / 580
» On the Convergence of Immune Algorithms
Sort
View
WSC
2007
15 years 2 months ago
Finite-sample performance guarantees for one-dimensional stochastic root finding
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
Samuel Ehrlichman, Shane G. Henderson
ESIAT
2009
IEEE
14 years 9 months ago
Path Planning Based on Dynamic Sub-population Pseudo-Parallel Genetic Algorithm
Through analysis of present pseudo-parallel genetic algorithm, propose a new dynamic sub-population pseudo-parallel genetic algorithm. It changes the condition that the magnitude o...
Lei Li, Yuemei Ren, Changyu Yang
WSC
2004
15 years 1 months ago
Retrospective Approximation Algorithms for the Multidimensional Stochastic Root-Finding Problem
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
Raghu Pasupathy, Bruce W. Schmeiser
FSS
2006
114views more  FSS 2006»
14 years 12 months ago
Fuzzy logic based variable step size algorithm for blind delayed source separation
Convergence of blind delayed source separation algorithms, which use constant learning rates, is known to be slow. We propose a fuzzy logic based approach to adaptively select the...
Vivek Nigam, Roland Priemer
TWC
2008
107views more  TWC 2008»
14 years 11 months ago
A low complexity user scheduling algorithm for uplink multiuser MIMO systems
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
Yangyang Zhang, Chunlin Ji, Yi Liu, Wasim Q. Malik...