Sciweavers

5331 search results - page 48 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ICCAD
2000
IEEE
188views Hardware» more  ICCAD 2000»
14 years 3 months ago
Bus Optimization for Low-Power Data Path Synthesis Based on Network Flow Method
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
Sungpack Hong, Taewhan Kim
INFORMATICALT
2000
104views more  INFORMATICALT 2000»
13 years 11 months ago
Nonlinear Stochastic Optimization by the Monte-Carlo Method
Methods for solving stochastic optimization problems by Monte-Carlo simulation are considered. The stoping and accuracy of the solutions is treated in a statistical manner, testing...
Leonidas Sakalauskas
IDEAL
2005
Springer
14 years 4 months ago
Designing an Optimal Network Using the Cross-Entropy Method
Consider a network of unreliable links, each of which comes with a certain price and reliability. Given a fixed budget, which links should be bought in order to maximize the syste...
Sho Nariai, Kin-Ping Hui, Dirk P. Kroese
ECML
2007
Springer
14 years 5 months ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
MP
2010
162views more  MP 2010»
13 years 9 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng