110 search results - page 5 / 22 » Greedy List Intersection |
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...
EUROPAR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put em...
MOBIHOC
2004
ACM
14 years 9 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
SAC
2003
ACM
14 years 3 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
COCO
1997
Springer
14 years 2 months ago
1997
Springer
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...