1594 search results - page 236 / 319 » An Algorithm to Compute Collusion Paths |
125
click to vote
SPAA
1995
ACM
15 years 6 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
135
click to vote
ICPP
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
132
click to vote
GD
2009
Springer
15 years 7 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
174
click to vote
TASE
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
128
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...