We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Abstract-- In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resourc...
Daniel Zappala, Virginia Mary Lo, Chris GauthierDi...
— Game theoretical approaches have been recently used to develop patrolling strategies for mobile robots. The idea is that the patroller and the intruder play a game, whose outco...
Francesco Amigoni, Nicola Basilico, Nicola Gatti, ...
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...