860 search results - page 113 / 172 » Biased Random Walks |
JSAT
2008
14 years 9 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
LMCS
2006
14 years 9 months ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
FGCS
2010
14 years 8 months ago
2010
In a distributed system where scalability is an issue, like in a GRID [5], the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mut...
107
click to vote
ICST
2010
IEEE
14 years 8 months ago
2010
IEEE
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
SIGCOMM
2010
ACM
14 years 8 months ago
2010
ACM
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...