3608 search results - page 236 / 722 » computer 2011 |
162
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
153
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
145
click to vote
KI
2011
Springer
14 years 11 months ago
2011
Springer
We have parallelized our general game player Ary on a cluster of computers. We propose multiple parallelization algorithms. For the sake of simplicity all our algorithms have proce...
166
click to vote
MOC
2011
14 years 11 months ago
2011
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
238
click to vote
PC
2011
14 years 11 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...