Sciweavers

5331 search results - page 357 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
HPCC
2007
Springer
16 years 27 days ago
Hybrid Line Search for Multiobjective Optimization
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
Crina Grosan, Ajith Abraham
SIAMSC
2008
139views more  SIAMSC 2008»
15 years 6 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 8 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 7 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
ICCAD
2006
IEEE
123views Hardware» more  ICCAD 2006»
16 years 3 months ago
A revisit to floorplan optimization by Lagrangian relaxation
With the advent of deep sub-micron (DSM) era, floorplanning has become increasingly important in physical design process. In this paper we clarify a misunderstanding in using Lag...
Chuan Lin, Hai Zhou, Chris C. N. Chu