Sciweavers

5331 search results - page 402 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
NOMS
2008
IEEE
16 years 1 months ago
A novel approach to bottleneck analysis in networks
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
Nikhil Shetty, Assane Gueye, Jean C. Walrand
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 6 months ago
Integrality Gaps of Linear and Semi-definite Programming Relaxations for Knapsack
Recent years have seen an explosion of interest in lift and project methods, such as those proposed by Lov
Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
16 years 7 days ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
ICIP
2006
IEEE
16 years 8 months ago
Multichannel Autofocus Algorithm for Synthetic Aperture Radar
The autofocus problem in synthetic aperture radar (SAR) is considered, where phase errors in the acquired signal data result in imagery that is improperly focused. We present a ne...
Robert L. Morrison Jr., Minh N. Do
SIAMJO
2008
99views more  SIAMJO 2008»
15 years 6 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti