2168 search results - page 123 / 434 » Randomized Algorithms and Complexity Theory |
139
click to vote
TAMC
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
128
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
ISCAS
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, we describe a simple second-order discrete-time model for the Transmission Control Protocol (TCP) with Random Early Detection (RED) algorithm. The TCP/RED mechan...
146
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
106
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...