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 ...
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...
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...
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...
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...