192 search results - page 15 / 39 » Complexity Bounds for Regular Games |
LATA
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
WG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
UAI
2003
13 years 10 months ago
2003
We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov styl...
CIAC
2010
Springer
14 years 10 days ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Two infinite families of self-similar tilings are described which have apparently not been reported before. Each tiling is based on a single prototile that is a segment of a regul...