3206 search results - page 64 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
EGH
2003
Springer
15 years 7 months ago
2003
Springer
In this paper, we present several optimizations to our previously presented soft shadow volume algorithm. Our optimizations include tighter wedges, heavily optimized pixel shader ...
122
click to vote
VEE
2006
ACM
15 years 8 months ago
2006
ACM
Many new Java runtime optimizations report relatively small, single-digit performance improvements. On modern virtual and actual hardware, however, the performance impact of an op...
111
click to vote
VTC
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper, we evaluate the performance of adaptive algorithms for selecting the number of redundant packets by jointly considering the forward error correction (FEC) and au...
134
click to vote
IJCAI
2007
15 years 3 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
114
Voted
SODA
2000
ACM
15 years 3 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...