Sciweavers

3049 search results - page 34 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 1 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
TSP
2008
126views more  TSP 2008»
13 years 7 months ago
HOS-Based Semi-Blind Spatial Equalization for MIMO Rayleigh Fading Channels
In this paper we concentrate on the direct semi-blind spatial equalizer design for MIMO systems with Rayleigh fading channels. Our aim is to develop an algorithm which can outperf...
Zhiguo Ding, Tharmalingam Ratnarajah, Colin Cowan
ESANN
2008
13 years 9 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
13 years 2 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 7 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein