5005 search results - page 352 / 1001 » The Design and Analysis of Parallel Algorithms |
138
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
— In 1982 Ungerboeck presented a set-partitioning design technique for trellis coded modulation (TCM). Although this technique directly assigns constellation points to the branch...
166
click to vote
CONCUR
2010
Springer
15 years 6 months ago
2010
Springer
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
233
click to vote
POPL
2005
ACM
16 years 5 months ago
2005
ACM
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
136
click to vote
HYBRID
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper we present algorithms and tools for fast and efficient reachability analysis, applicable to continuous and hybrid systems. Most of the work on reachability ...
154
click to vote
GLVLSI
2008
IEEE
15 years 11 months ago
2008
IEEE
Statistical static timing analysis (SSTA) plays a key role in determining performance of the VLSI circuits implemented in state-of-the-art CMOS technology. A pre-requisite for emp...