15485 search results - page 2946 / 3097 » Computing Optimal Subsets |
119
Voted
ICS
1998
Tsinghua U.
15 years 6 months ago
1998
Tsinghua U.
In this paper we propose and evaluate the Adaptive++ technique, a novel runtime-only data prefetching strategy for software-based distributed shared-memory systems (software DSMs)...
120
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
119
click to vote
PPOPP
1997
ACM
15 years 6 months ago
1997
ACM
Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming sys...
120
click to vote
SPAA
1997
ACM
15 years 6 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
112
Voted
CVRMED
1997
Springer
15 years 6 months ago
1997
Springer
During the past year our group has been developing HipNav, a system which helps surgeons determine optimal, patient-specific acetabular implant placement and accurately achieve the...