6393 search results - page 107 / 1279 » Randomized Algorithms on the Mesh |
122
Voted
TCS
1998
15 years 3 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
142
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
128
Voted
STOC
1991
ACM
15 years 7 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
128
Voted
WSC
2008
15 years 5 months ago
2008
We propose a framework for optimization problems based on particle filtering (also called Sequential Monte Carlo method). This framework unifies and provides new insight into rand...
124
Voted
SODA
1993
ACM
15 years 4 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...