Sciweavers

3809 search results - page 559 / 762
» Randomized Broadcast in Networks
Sort
View
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
15 years 5 months ago
Sampling Unlabeled Biconnected Planar Graphs
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 ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
DSN
2003
IEEE
15 years 4 months ago
Characterization of Linux Kernel Behavior under Errors
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...
Weining Gu, Zbigniew Kalbarczyk, Ravishankar K. Iy...
ICDCS
2002
IEEE
15 years 4 months ago
Routing Indices For Peer-to-Peer Systems
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...
Arturo Crespo, Hector Garcia-Molina
ESEM
2007
ACM
15 years 3 months ago
The Effects of Over and Under Sampling on Fault-prone Module Detection
The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which ar...
Yasutaka Kamei, Akito Monden, Shinsuke Matsumoto, ...
GLOBECOM
2009
IEEE
15 years 3 months ago
Stochastic Properties and Application of City Section Mobility Model
Abstract--Node mobility has a direct impact on the performance evaluation of various network mobility protocols. Unfortunately, most of the analysis on mobility protocols used Rand...
Md. Shohrab Hossain, Mohammed Atiquzzaman