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 ...
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
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...
Abstract. We give an elementary theory of Henselian local rings and construct the Henselization of a local ring. All our theorems have an algorithmic content.
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling in behavioral synthesis. The problem of schedulin...