Sciweavers

833 search results - page 13 / 167
» Simpler and better approximation algorithms for network desi...
Sort
View
WWW
2003
ACM
14 years 8 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
INFOCOM
2009
IEEE
14 years 2 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
INFOCOM
2005
IEEE
14 years 1 months ago
Practical routing-layer support for scalable multihoming
— The recent trend of rapid increase in routing table sizes at routers comprising the Internet’s core is posing a serious challenge to the current Internet’s scalability, ava...
Ramakrishna Gummadi, Ramesh Govindan
FOCS
2009
IEEE
14 years 2 months ago
On the Power of Randomization in Algorithmic Mechanism Design
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
Shahar Dobzinski, Shaddin Dughmi
EWSN
2011
Springer
12 years 11 months ago
An Adaptive Algorithm for Compressive Approximation of Trajectory (AACAT) for Delay Tolerant Networks
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...
Rajib Kumar Rana, Wen Hu, Tim Wark, Chun Tung Chou