627 search results - page 44 / 126 » Kolmogorov-Loveland Randomness and Stochasticity |
IPCO
2010
13 years 10 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
SAGA
2009
Springer
14 years 3 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
WICON
2008
13 years 10 months ago
2008
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
BC
2004
13 years 8 months ago
2004
A computational model is presented for the detection of coherent motion based on template matching and hidden Markov models. The premise of this approach is that the growth in dete...