Sciweavers

4117 search results - page 331 / 824
» On the Satisfiability of Complex Constraints
Sort
View
GD
2006
Springer
15 years 10 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
CPAIOR
2010
Springer
15 years 10 months ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
ASPDAC
2008
ACM
150views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Constraint-free analog placement with topological symmetry structure
Abstract-- In analog circuits, blocks need to be placed symmetrically to satisfy the devices matching. Different from the existing constraint-driven approaches, the proposed topolo...
Qing Dong, Shigetoshi Nakatake
APPROX
2008
Springer
137views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Directed Weighted-Degree Constrained Networks
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
Zeev Nutov
EUC
2008
Springer
15 years 8 months ago
Dynamic and Leakage Power Minimization with Loop Voltage Scheduling and Assignment
This paper studies the scheduling and assignment problem that minimizes the total energy including both dynamic and leakage energy for applications with loops on multi-voltage, mul...
Meikang Qiu, Jiande Wu, Jingtong Hu, Yi He, Edwin ...