105 search results - page 4 / 21 » Linear Time Algorithm for Weak Parity Games |
ICFEM
2009
Springer
13 years 5 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Online boosting methods have recently been used successfully for tracking, background subtraction etc. Conventional online boosting algorithms emphasize on interchanging new weak ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
CIE
2008
Springer
13 years 9 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...