5138 search results - page 51 / 1028 » Randomized Algorithms for 3-SAT |
135
click to vote
CISS
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— We consider a joint randomized scheduling, congestion control mechanism for general wireless networks. We allow for a set of imperfections in the operation of the rando...
123
click to vote
FOCS
1994
IEEE
15 years 5 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
137
click to vote
COMGEO
1999
ACM
15 years 1 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
141
click to vote
TSE
2011
14 years 8 months ago
2011
—Randomized testing is an effective method for testing software units. Thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such...
120
click to vote
ESA
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...