356 search results - page 48 / 72 » On the Global Solution of Linear Programs with Linear Comple... |
ASPDAC
2005
ACM
14 years 2 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper describes a new algorithm for recovering the
3D shape and motion of deformable and articulated objects
purely from uncalibrated 2D image measurements using an
iterati...
GECCO
2006
Springer
14 years 12 days ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
COCOA
2009
Springer
14 years 3 months ago
2009
Springer
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...