Sciweavers

49 search results - page 4 / 10
» Cost Evaluation of Soft Global Constraints
Sort
View
TVCG
2011
120views more  TVCG 2011»
13 years 2 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
MICCAI
2010
Springer
13 years 6 months ago
Reconstructing Geometrically Consistent Tree Structures from Noisy Images
Abstract. We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bif...
Engin Türetken, Christian Blum, Germán...
IJCAI
2001
13 years 9 months ago
A Constraint Satisfaction Approach to Parametric Differential Equations
Parametric ordinary differential equations arise in many areas of science and engineering. Since some of the data is uncertain and given by intervals, traditional numerical method...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 1 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...