Sciweavers

400 search results - page 11 / 80
» Extended formulations in combinatorial optimization
Sort
View
GLVLSI
1998
IEEE
129views VLSI» more  GLVLSI 1998»
15 years 1 months ago
Tabu Search Based Circuit Optimization
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
Sadiq M. Sait, Habib Youssef, Munir M. Zahra
88
Voted
COCOA
2009
Springer
15 years 4 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
AAAI
2007
14 years 12 months ago
Multi-Objective Russian Doll Search
Russian Doll Search (RDS) is a well-known algorithm for combinatorial optimization. In this paper we extend it from mono-objective to multi-objective optimization. We demonstrate ...
Emma Rollon, Javier Larrosa
ECCV
2008
Springer
14 years 11 months ago
Reformulating and Optimizing the Mumford-Shah Functional on a Graph - A Faster, Lower Energy Solution
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...
Leo Grady, Christopher V. Alvino
IJCNN
2007
IEEE
15 years 3 months ago
On Extending the SMO Algorithm Sub-Problem
—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimizatio...
Christopher Sentelle, Michael Georgiopoulos, Georg...