6413 search results - page 1115 / 1283 » Classes of cycle bases |
184
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
203
click to vote
MST
2006
15 years 6 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
147
click to vote
PAMI
2008
15 years 6 months ago
2008
Morphological attribute filters have not previously been parallelized mainly because they are both global and nonseparable. We propose a parallel algorithm that achieves efficient ...
160
click to vote
IANDC
2007
15 years 6 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
198
click to vote
IANDC
2007
15 years 6 months ago
2007
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...