8699 search results - page 1594 / 1740 » Elements of the Theory of Computation |
134
click to vote
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
113
click to vote
CF
2007
ACM
15 years 3 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
107
click to vote
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
105
click to vote
CG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...