MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Abstract. Though some studies involving general micro-mobility exist, micromobility research concerning a mobile node (MN) moving between Mobile Anchor Points (MAP) is lacking. In ...
Benchmarking as a method of assessing software performance is known to suffer from random fluctuations that distort the observed performance. In this paper, we focus on the fluctua...
One of the reasons that search performance of peerto-peer file-sharing systems is poor is that results are poorly described, hurting the client’s ability to rank them. This is a...