4759 search results - page 501 / 952 » Parallelizing the Phylogeny Problem |
194
click to vote
HCW
2000
IEEE
15 years 11 months ago
2000
IEEE
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
179
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
184
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
154
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Time skewing is a compile-time optimization that can provide arbitrarily high cache hit rates for a class of iterative calculations, given a sufficient number of time steps and s...
157
click to vote
AGENTS
2000
Springer
15 years 11 months ago
2000
Springer
Recent research has made it possible to build information agents that retrieve and integrate information from the World Wide Web. Although there now exist solutions for modeling W...