1089 search results - page 68 / 218 » Bounds on generalized Frobenius numbers |
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
ENDM
2008
13 years 7 months ago
2008
We highlight intriguing analogies between the diameter of a polytope and the largest possible total curvature of the associated central path. We prove continuous analogues of the ...
TPDS
1998
13 years 7 months ago
1998
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...