5608 search results - page 89 / 1122 » On the Theory of Matchgate Computations |
105
click to vote
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. 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...
112
click to vote
ARITH
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
132
click to vote
Presentation
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources, Poster Presentation at Microsoft TechVista Delhi. (October 2007)
107
click to vote
ICDCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies—modeled via dags—for Internet-based computing. The goal of th...
127
click to vote
JUCS
2006
15 years 1 months ago
2006
: Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called "Bologna process". We survey th...