3247 search results - page 440 / 650 » Randomized smoothing networks |
181
click to vote
SASO
2007
IEEE
16 years 25 days ago
2007
IEEE
Many unstructured peer to peer (P2P) systems rely on a Peer Sampling Service (PSS) that returns randomly sampled nodes from the population comprising the system. PSS protocols are...
161
click to vote
WEA
2007
Springer
16 years 20 days ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
168
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
138
click to vote
DSN
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper describes an experimental study of Linux kernel behavior in the presence of errors that impact the instruction stream of the kernel code. Extensive error injection exper...
175
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...