13214 search results - page 373 / 2643 » Pseudorandomness for network algorithms |
183
click to vote
TFS
2008
15 years 6 months ago
2008
Abstract--Flocking algorithms essentially consist of three components: alignment, cohesion, and separation. To track a desired trajectory, the flock center should move along the de...
149
click to vote
JAL
2002
15 years 6 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
178
click to vote
TPDS
1998
15 years 6 months ago
1998
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
178
click to vote
TON
2010
15 years 1 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
255
click to vote
ICAISC
2004
Springer
16 years 6 days ago
2004
Springer
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...