A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Abstract— An adaptive handover algorithm for wireless comn systems is addressed in this extended abstract. Moving from the Generalized Extended Least Square handover algorithm in...
Claudia Rinaldi, Fortunato Santucci, Carlo Fischio...
Finding a good wavelet for a particular application and type of input data is a difficult problem. Traditional methods of wavelet deus on abstract properties of the wavelet that ca...
One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasin...