6111 search results - page 216 / 1223 » Time, Hardware, and Uniformity |
103
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
95
Voted
ESA
2003
Springer
15 years 6 months ago
2003
Springer
We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISP’s) to offer different levels of Quality of Service (QoS) to diffe...
121
click to vote
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
93
Voted
EWRL
2008
15 years 2 months ago
2008
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
109
Voted
ADHOCNOW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...