Sciweavers

2924 search results - page 567 / 585
» Lower Bounds in Distributed Computing
Sort
View
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 9 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
MOBIHOC
2008
ACM
14 years 7 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...
EVOW
2006
Springer
13 years 11 months ago
A Preliminary Study on Handling Uncertainty in Indicator-Based Multiobjective Optimization
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
Matthieu Basseur, Eckart Zitzler
ACMICEC
2008
ACM
195views ECommerce» more  ACMICEC 2008»
13 years 9 months ago
DRM domain authentication using electronic payment systems
This paper focuses on the problem of how to allow sharing of copyrighted content between a set of authorised devices and preventing unauthoried copying of content to other devices...
Imad M. Abbadi, Muntaha Alawneh