1830 search results - page 71 / 366 » Workshop on Graph Computation Models |
147
click to vote
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
109
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
131
click to vote
SODA
1994
ACM
15 years 5 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
117
Voted
WSC
2004
15 years 5 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
145
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...