363 search results - page 24 / 73 » Decomposition of the NVALUE constraint |
120
click to vote
PATAT
2004
Springer
15 years 3 months ago
2004
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
69
Voted
UAI
2008
14 years 11 months ago
2008
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
93
Voted
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an impor...
AIPS
2008
14 years 12 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
102
click to vote
ASPDAC
2010
ACM
14 years 7 months ago
2010
ACM
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...