2084 search results - page 404 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
107
click to vote
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
VLDB
2001
ACM
15 years 2 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
116
click to vote
ICPADS
1994
IEEE
15 years 1 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...