478 search results - page 16 / 96 » A simple expected running time analysis for randomized |
150
click to vote
SPAA
1996
ACM
15 years 9 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
144
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
151
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
151
click to vote
ECML
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Designs of micro electro-mechanical devices need to be robust against fluctuations in mass production. Computer experiments with tens of parameters are used to explore th...
182
click to vote
INFOCOM
2009
IEEE
16 years 7 days ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...