6568 search results - page 354 / 1314 » Reducing the Complexity of Reductions |
159
Voted
ISCAS
1999
IEEE
15 years 12 months ago
1999
IEEE
Radix-r modulo rn multipliers and adders are introduced in this paper. The proposed architectures are shown to require several times less area than previously reported architectur...
186
Voted
ISCAS
1999
IEEE
15 years 12 months ago
1999
IEEE
A method for modeling complex CMOS gates by the reduction of each gate to an effective equivalent inverter is introduced. The conducting and parasitic behavior of parallel and ser...
209
click to vote
DAGSTUHL
2006
15 years 9 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
158
Voted
WSC
1998
15 years 9 months ago
1998
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
177
click to vote
CORR
2004
Springer
15 years 7 months ago
2004
Springer
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...