2084 search results - page 166 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
140
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
157
Voted
LCN
2000
IEEE
15 years 8 months ago
2000
IEEE
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
157
click to vote
SIGECOM
2008
ACM
15 years 5 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
174
click to vote
DIALM
2003
ACM
15 years 10 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
144
Voted
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
The paper presents a new distributed metaheuristic algorithm in an optimal control problem related to the cooling process in the continuous casting of steel. The optimization task...