4759 search results - page 604 / 952 » Parallelizing the Phylogeny Problem |
157
click to vote
PODC
2004
ACM
16 years 3 days ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
178
Voted
PODC
2004
ACM
16 years 3 days ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
150
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only s...
169
click to vote
EUROPAR
2004
Springer
16 years 2 days ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
147
click to vote
FIDJI
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. When dealing with distributed systems, one of the most important problems that has to be addressed is concurrency. Distributed systems are inherently concurrent, distribu...