595 search results - page 34 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
123
click to vote
ISSS
1999
IEEE
15 years 7 months ago
1999
IEEE
Specifications of data computations may not necessarily describe the ranges of the intermediate results that can be generated. However, such information is critical to determine t...
131
Voted
ICPP
1998
IEEE
15 years 7 months ago
1998
IEEE
To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as pos...
123
Voted
TCAD
1998
15 years 2 months ago
1998
Abstract—We examine the implications of a new hazard-free combinational logic synthesis method [1], which generates multiplexor-based networks from binary decision diagrams (BDDs...
135
Voted
ICCAD
1994
IEEE
15 years 6 months ago
1994
IEEE
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
153
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...