1650 search results - page 202 / 330 » The HOM problem is decidable |
142
click to vote
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
143
click to vote
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
164
click to vote
SIAMDM
2010
15 years 3 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
195
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
150
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We present a novel Quadratic Program (QP) formulation for robust multi-model fitting of geometric structures in vision data. Our objective function enforces both the fidelity of...