1502 search results - page 138 / 301 » Node weighted scheduling |
115
Voted
AINA
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—We propose PRoPHET+, a routing scheme for opportunistic networks designed to maximize successful data delivery rate and minimize transmission delay. PRoPHET+ computes a ...
124
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
138
Voted
MP
2006
15 years 3 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
117
click to vote
JPDC
2007
15 years 3 months ago
2007
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile a...
132
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...