499 search results - page 55 / 100 » Multilevel algorithms for linear ordering problems |
EI
1998
13 years 10 months ago
1998
In order to properly calibrate an electronic camera for a variety of illuminantsit is necessary to estimate the spectral sensitivity of the camera. This spectral characterisation ...
CPAIOR
2011
Springer
13 years 17 days ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
CP
2004
Springer
14 years 2 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...