4372 search results - page 39 / 875 » Algorithmic Theories of Everything |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
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 ...
JCB
2007
13 years 8 months ago
2007
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...
CN
2004
13 years 8 months ago
2004
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...
MLQ
2008
13 years 8 months ago
2008
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.
CODES
2003
IEEE
14 years 1 months ago
2003
IEEE
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...