2314 search results - page 370 / 463 » Minimal Partitions of a Graph |
132
Voted
CLUSTER
2006
IEEE
15 years 3 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
123
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
125
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
134
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
112
Voted
IPL
2007
15 years 3 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...