595 search results - page 42 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
116
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
115
click to vote
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by ext...
115
Voted
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
Applications from the embedded consumer domain put challenging requirements on SoC infrastructures, i.e. interconnect and memory. Specifically, video applications demand large sto...
140
Voted
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
121
Voted
AAAI
1996
15 years 4 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...