65 search results - page 10 / 13 » Uniform Derandomization from Pathetic Lower Bounds |
MST
2011
13 years 2 months ago
2011
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...
KI
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
RSA
2010
13 years 5 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
ISTCS
1993
Springer
13 years 11 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...