14548 search results - page 2444 / 2910 » The Optimal Path-Matching Problem |
220
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
208
click to vote
PLDI
2009
ACM
16 years 2 months ago
2009
ACM
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
144
click to vote
WWW
2009
ACM
16 years 2 months ago
2009
ACM
This paper proposes and evaluates a Network Aware Forward Caching approach for determining the optimal deployment strategy of forward caches to a network. A key advantage of this ...
200
click to vote
LCTRTS
2009
Springer
16 years 2 months ago
2009
Springer
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
251
click to vote
IEEEPACT
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract—Optimizing compilers apply numerous interdependent optimizations, leading to the notoriously difficult phase-ordering problem — that of deciding which transformations...