338 search results - page 21 / 68 » Effective Lower Bounding Techniques for Pseudo-Boolean Optim... |
ISPD
2004
ACM
14 years 1 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined ...
ISLPED
1999
ACM
14 years 8 days ago
1999
ACM
While guarded evaluation has proven an effective energy saving technique in arithmetic circuits, good methodologies do not exist for determining when and how to guard for maximal ...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
This paper presents an algorithm to bound the bandwidth of a Web crawler. The crawler collects statistics on the transfer rate of each server to predict the expected bandwidth use...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...