13214 search results - page 103 / 2643 » Pseudorandomness for network algorithms |
168
click to vote
NETWORKS
2010
15 years 4 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
187
click to vote
ADHOCNETS
2010
Springer
15 years 3 months ago
2010
Springer
The current specification for IEEE 802.15.4 beacon-enabled networks does not define how active and sleep schedules should be configured in order to achieve the optimal network perf...
180
click to vote
ICCCN
2007
IEEE
15 years 10 months ago
2007
IEEE
A new physical layer technique [1] for broadcasting in multi-hop wireless ad hoc networks makes broadcast a much more efficient building block than traditional flooding broadcast. ...
192
click to vote
WEA
2007
Springer
16 years 15 days ago
2007
Springer
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
143
click to vote
ICNP
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which o er no QoS guarant...