4759 search results - page 537 / 952 » Parallelizing the Phylogeny Problem |
156
click to vote
SAC
2003
ACM
16 years 1 days ago
2003
ACM
Shared dataspaces `a la Linda, and the underlying data-driven coordination model, have been successfully exploited in the development of a huge variety of applications, going from...
172
click to vote
EUROPAR
2003
Springer
16 years 3 hour ago
2003
Springer
The process of design search and optimisation is characterised by its computationally intensive operations, which produce a problem well suited to Grid computing. Here we present a...
180
click to vote
GRID
2003
Springer
15 years 12 months ago
2003
Springer
Typical Grid computing scenarios involve many distributed hardware and software components. The more components that are involved, the more likely it is that one of them may fail....
162
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
173
click to vote
PODC
2009
ACM
15 years 11 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...