13214 search results - page 77 / 2643 » Pseudorandomness for network algorithms |
140
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We propose simple and efficient sorting algorithm for unreliable single hop radio network. (In such network each listening station
182
click to vote
ICCSA
2007
Springer
16 years 13 days ago
2007
Springer
In this paper we address the problem of working paths optimization in survivable MPLS network. We focus on an existing facility network, in which only network flows can be optimize...
169
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract- This paper describes an algorithm for optimally placing a given number of wavelength converters in All-Optical Networks(A0Ns) with arbitrary topologies. We first introduc...
136
click to vote
ESANN
2000
15 years 7 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
168
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....