1557 search results - page 94 / 312 » Programming up to Congruence |
159
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
136
click to vote
ASYNC
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper presents an in-depth case study in highperformance asynchronous adder design. A recent method, called “speculative completion”, is used. This method uses single-rai...
118
Voted
DAC
1997
ACM
15 years 9 months ago
1997
ACM
We present a novel technique CLIP for optimizing both the height and width of CMOS cell layouts in the two-dimensional (2D) style. CLIP is based on integer-linear programming (ILP...
155
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
132
click to vote
AISC
2006
Springer
15 years 9 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...