13214 search results - page 97 / 2643 » Pseudorandomness for network algorithms |
188
click to vote
EWSN
2008
Springer
16 years 6 months ago
2008
Springer
Storing and disseminating coded information instead of the original data can bring significant performance improvements to sensor network protocols. Such methods reduce the risk of...
161
click to vote
ISPDC
2008
IEEE
16 years 24 days ago
2008
IEEE
Identifying and inferring performances of a network topology is a well known problem. Achieving this by using only end-to-end measurements at the application level is a method kno...
175
click to vote
ICCNMC
2005
Springer
15 years 12 months ago
2005
Springer
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in...
162
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
163
click to vote
ICCSA
2005
Springer
15 years 12 months ago
2005
Springer
The major objective of this paper is to deploy an effective evolutionary algorithm (EA) for the congestion problem in connection-oriented networks. The network flow is modeled as n...