13214 search results - page 284 / 2643 » Pseudorandomness for network algorithms |
216
click to vote
IPL
2010
15 years 1 months ago
2010
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
157
click to vote
ICANN
2007
Springer
16 years 26 days ago
2007
Springer
We propose a fully distributed message passing algorithm based on expectation propagation for the purpose of sensor localization. Sensors perform noisy measurements of their mutual...
184
click to vote
STACS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
153
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
175
Voted
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
It is often reported in the technique literature that the success of the self-organizing feature map (SOM) formation is critically dependent on the initial weights and the selectio...