Sciweavers

5331 search results - page 134 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Bounded gradient projection methods for sparse signal recovery
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...
TCAD
1998
107views more  TCAD 1998»
14 years 9 months ago
Optimizing dominant time constant in RC circuits
— Conventional methods for optimal sizing of wires and transistors use linear resistor-capacitor (RC) circuit models and the Elmore delay as a measure of signal delay. If the RC ...
Lieven Vandenberghe, Stephen P. Boyd, Abbas A. El ...
ORL
2007
102views more  ORL 2007»
14 years 9 months ago
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
Sergiy Butenko, Svyatoslav Trukhanov
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 3 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
PVM
1998
Springer
15 years 2 months ago
Implementation of Monte Carlo Algorithms for Eigenvalue Problem Using MPI
The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered. Three almost optimal Monte Carlo algorithms are presented:
Ivan Dimov, Vassil N. Alexandrov, Aneta Karaivanov...