1502 search results - page 140 / 301 » Node weighted scheduling |
137
Voted
RTCSA
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task’s processor share is specified as a weight. When a task is reweighted, a ...
161
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
145
Voted
DICTA
2003
15 years 5 months ago
2003
This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We for...
191
Voted
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
—In the context of mobile ad hoc networks (MANETs) routing, we propose a clustering algorithm called Connectivity, Energy and Mobility driven Clustering Algorithm (CEMCA). The ai...
116
Voted
JDA
2007
15 years 3 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...