147 search results - page 3 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—We analyze the delay performance of a multihop wireless network with a fixed route between each sourcedestination pair. There are arbitrary interference constraints on ...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
COCO
2003
Springer
14 years 3 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
DIALM
2005
ACM
13 years 11 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
ALDT
2009
Springer
14 years 4 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...