47 search results - page 4 / 10 » Deterministic random walks on the integers |
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
CP
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We propose a simple and efficient deterministic extractor for an ordinary elliptic curve E, defined over F2n , where n = 2 and is a positive integer. Our extractor, for a given poi...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
IOR
2010
13 years 6 months ago
2010
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...