942 search results - page 39 / 189 » Constraints in Graph Drawing Algorithms |
GECCO
2000
Springer
14 years 8 days ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
CPAIOR
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
CP
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait...
GD
2006
Springer
14 years 10 days ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...