13214 search results - page 305 / 2643 » Pseudorandomness for network algorithms |
151
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
205
click to vote
KES
2005
Springer
16 years 7 days ago
2005
Springer
A Decentralised Adaptive Clustering (DAC) algorithm for self-monitoring impact sensing networks is presented within the context of CSIRO-NASA Ageless Aerospace Vehicle project. DAC...
195
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this...
157
click to vote
IJON
2008
15 years 6 months ago
2008
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
193
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...