1594 search results - page 169 / 319 » An Algorithm to Compute Collusion Paths |
215
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
124
Voted
DAC
2007
ACM
16 years 4 months ago
2007
ACM
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
133
Voted
CODES
2009
IEEE
15 years 4 months ago
2009
IEEE
We present a novel loop transformation technique, particularly well suited for optimizing embedded compilers, where an increase in compilation time is acceptable in exchange for s...
85
Voted
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— This paper presents a solution to decentralized Voronoi coverage in non-convex polygonal environments. We show that complications arise when existing approaches to Voronoi cove...
153
click to vote
SCAM
2008
IEEE
15 years 10 months ago
2008
IEEE
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...