729 search results - page 82 / 146 » Solving subgraph isomorphism problems with constraint progra... |
113
click to vote
EOR
2007
15 years 3 months ago
2007
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
147
click to vote
ISPD
2003
ACM
15 years 9 months ago
2003
ACM
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first ...
115
click to vote
CP
2006
Springer
15 years 7 months 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...
149
click to vote
ICCAD
2009
IEEE
15 years 1 months ago
2009
IEEE
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
114
click to vote
PADL
2007
Springer
15 years 10 months ago
2007
Springer
We describe a preliminary implementation of the high-level modelling language Zinc. This language supports a modelling methodology in which the same Zinc model can be automatically...