Sciweavers

1404 search results - page 92 / 281
» Optimization problems in multiple-interval graphs
Sort
View
CPAIOR
2010
Springer
15 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
IPPS
2003
IEEE
15 years 11 months ago
Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
Peter Korosec, Jurij Silc, Borut Robic
SIBGRAPI
2006
IEEE
16 years 9 days ago
Actively Illuminated Objects using Graph-Cuts
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
Asla Medeiros Sá, Marcelo Bernardes Vieira,...
CEC
2007
IEEE
16 years 19 days ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
ECCV
2008
Springer
16 years 8 months ago
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
Maria Klodt, Thomas Schoenemann, Kalin Kolev, Mare...