627 search results - page 18 / 126 » Kolmogorov-Loveland Randomness and Stochasticity |
ORL
2008
13 years 8 months ago
2008
We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...
ECAI
2006
Springer
14 years 12 days ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
CAAN
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
SIGMETRICS
2012
ACM
11 years 11 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
EPEW
2006
Springer
14 years 12 days ago
2006
Springer
We propose new techniques to simplify the computation of the cycle times and the absorption times for a large class of PEPA models. These techniques allow us to simplify the model ...