Sciweavers

14739 search results - page 266 / 2948
» An optimization problem on the sphere
Sort
View
219
Voted
COMPGEOM
2001
ACM
15 years 10 months ago
The convex hull of ellipsoids
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
DAC
2006
ACM
16 years 7 months ago
Optimal simultaneous mapping and clustering for FPGA delay optimization
Both technology mapping and circuit clustering have a large impact on FPGA designs in terms of circuit performance, area, and power dissipation. Existing FPGA design flows carry o...
Joey Y. Lin, Deming Chen, Jason Cong
IPCO
1996
89views Optimization» more  IPCO 1996»
15 years 7 months ago
On Dependent Randomized Rounding Algorithms
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
134
Voted
IPCO
2001
125views Optimization» more  IPCO 2001»
15 years 7 months ago
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
Jean B. Lasserre
CEC
2009
IEEE
16 years 1 months ago
An adaptive learning particle swarm optimizer for function optimization
— Traditional particle swarm optimization (PSO) suffers from the premature convergence problem, which usually results in PSO being trapped in local optima. This paper presents an...
Changhe Li, Shengxiang Yang