Sciweavers

3049 search results - page 52 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
EMO
2005
Springer
123views Optimization» more  EMO 2005»
15 years 9 months ago
Initial Population Construction for Convergence Improvement of MOEAs
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
Christian Haubelt, Jürgen Gamenik, Jürge...
TNN
2010
176views Management» more  TNN 2010»
14 years 10 months ago
On the weight convergence of Elman networks
Abstract--An Elman network (EN) can be viewed as a feedforward (FF) neural network with an additional set of inputs from the context layer (feedback from the hidden layer). Therefo...
Qing Song
149
Voted
JSAC
2006
88views more  JSAC 2006»
15 years 4 months ago
OSNR optimization in optical networks: modeling and distributed algorithms via a central cost approach
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
L. Pavel
ICASSP
2008
IEEE
15 years 10 months ago
Iterative extrapolation algorithm for data reconstruction over sphere
Given limited or incomplete measurement data on a sphere, a new iterative algorithm is proposed on how to extrapolate signal over the whole sphere. The algorithm is based on a pri...
Wen Zhang, Rodney A. Kennedy, Thushara D. Abhayapa...
COLT
2000
Springer
15 years 8 months ago
Bias-Variance Error Bounds for Temporal Difference Updates
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
Michael J. Kearns, Satinder P. Singh