4047 search results - page 610 / 810 » The Discrete Basis Problem |
121
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
143
click to vote
DCG
2008
15 years 4 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
131
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We address the problem of autonomously learning controllers for visioncapable mobile robots. We extend McCallum's (1995) Nearest-Sequence Memory algorithm to allow for genera...
127
click to vote
CSDA
2006
15 years 4 months ago
2006
This article deals with the compact representation of incomplete probabilistic knowledge which can be encountered in risk evaluation problems, for instance in environmental studie...
115
click to vote
FS
2006
15 years 4 months ago
2006
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...