4469 search results - page 457 / 894 » Dynamic Program Slicing |
192
click to vote
CN
2002
15 years 6 months ago
2002
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
151
click to vote
ASAP
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
212
click to vote
ICPP
1998
IEEE
15 years 11 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
190
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of pr...
205
click to vote
JAVA
2000
Springer
15 years 10 months ago
2000
Springer
This paper describes a portable and efficient sampling-based online measurement system for production-level Java virtual machines. This system is designed to provide continuous re...