2497 search results - page 343 / 500 » Requirements for models of achievable routing |
SWAT
1992
Springer
15 years 6 months ago
1992
Springer
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
143
click to vote
SC
2000
ACM
15 years 5 months ago
2000
ACM
Compiler transformations can significantly improve data locality for many scientific programs. In this paper, we show iterative solvers for partial differential equations (PDEs) i...
124
click to vote
MKWI
2008
15 years 3 months ago
2008
: Semantic Business Process Management (SBPM) enhances BPM with semantic technologies in order to increase the degree of automation in the BPM lifecycle and help in bridging the ga...
105
click to vote
JPDC
2006
15 years 1 months ago
2006
Speculative pre-execution achieves efficient data prefetching by running additional prefetching threads on spare hardware contexts. Various implementations for speculative pre-exe...
101
click to vote
TSP
2008
15 years 1 months ago
2008
Abstract--We consider the adaptive detection of a signal of interest embedded in colored noise, when the environment is nonhomogeneous, i.e., when the training samples used for ada...