3455 search results - page 406 / 691 » Generalized Game Trees |
153
click to vote
AAAI
1996
15 years 8 months ago
1996
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...
167
click to vote
EJC
2010
15 years 6 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
183
Voted
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
187
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
166
click to vote
SIGCOMM
2010
ACM
15 years 7 months ago
2010
ACM
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...