Sciweavers

3049 search results - page 339 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
16 years 5 days ago
Improving EA-based design space exploration by utilizing symbolic feasibility tests
This paper will propose a novel approach in combining Evolutionary Algorithms with symbolic techniques in order to improve the convergence of the algorithm in the presence of larg...
Thomas Schlichter, Christian Haubelt, Jürgen ...
ICML
2004
IEEE
16 years 2 days ago
Gradient LASSO for feature selection
LASSO (Least Absolute Shrinkage and Selection Operator) is a useful tool to achieve the shrinkage and variable selection simultaneously. Since LASSO uses the L1 penalty, the optim...
Yongdai Kim, Jinseog Kim
ICC
1997
IEEE
109views Communications» more  ICC 1997»
15 years 11 months ago
Adaptive Power Control with MMSE Multiuser Detectors
Abstract: Power control algorithms assume that the receiver structure is fixed and iteratively update the transmit powers of the users to provide them with an acceptable quality o...
Sennur Ulukus, Roy D. Yates
ICML
2010
IEEE
15 years 4 months ago
The Margin Perceptron with Unlearning
We introduce into the classical Perceptron algorithm with margin a mechanism of unlearning which in the course of the regular update allows for a reduction of possible contributio...
Constantinos Panagiotakopoulos, Petroula Tsampouka
IOR
2010
98views more  IOR 2010»
15 years 3 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith