Sciweavers

1594 search results - page 23 / 319
» Fast Prediction on a Tree
Sort
View
CAV
2003
Springer
160views Hardware» more  CAV 2003»
14 years 1 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
CPM
2008
Springer
129views Combinatorics» more  CPM 2008»
13 years 9 months ago
Fast Algorithms for Computing Tree LCS
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-U...
ALENEX
2008
89views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Obtaining Optimal k-Cardinality Trees Fast
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen