840 search results - page 48 / 168 » The Complexity of the Extended GCD Problem |
JAIR
2008
13 years 7 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
SIAMDM
2010
13 years 6 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 ...
CONCUR
2007
Springer
14 years 2 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
ICCSA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
Spread Transform (ST) is a quantization watermarking algorithm in which vectors of the wavelet coefficients of a host work are quantized, using one of two dithered quantizers, to ...