595 search results - page 56 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
165
click to vote
TRIER
2002
15 years 3 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
141
click to vote
SC
1995
ACM
15 years 7 months ago
1995
ACM
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...
158
Voted
AI
2008
Springer
15 years 3 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
223
Voted
HPCA
2007
IEEE
15 years 9 months ago
2007
IEEE
Shared memory multiprocessors play an increasingly important role in enterprise and scientific computing facilities. Remote misses limit the performance of shared memory applicat...
112
click to vote
DATE
1999
IEEE
15 years 7 months ago
1999
IEEE
Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column ...