7 search results - page 1 / 2 » dialm 2008 |
DIALM
2008
ACM
15 years 10 days ago
2008
ACM
DIALM
2008
ACM
15 years 10 days ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
DIALM
2008
ACM
15 years 10 days ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
DIALM
2008
ACM
15 years 10 days ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
86
Voted
DIALM
2008
ACM
15 years 10 days ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...