Sciweavers

858 search results - page 69 / 172
» Sharing the Cost of a Capacity Network
Sort
View
GLOBECOM
2008
IEEE
13 years 10 months ago
A Framework for Dual-Agent MANET Routing Protocols
— Nodes forming mobile ad hoc networks (MANET) nodes can be logically partitioned into 1) a selfish user agent serving the interests of the end user (owner) of the mobile device...
Brian L. Gaines, Mahalingam Ramkumar
DSN
2005
IEEE
14 years 2 months ago
On Partial Protection in Groomed Optical WDM Mesh Networks
In this paper, we consider the problem of survivable network design in traffic groomed optical WDM mesh networks with sub-wavelength capacity connections. In typical survivable n...
Jing Fang, Mahesh Sivakumar, Arun K. Somani, Krish...
IOR
2006
173views more  IOR 2006»
13 years 9 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
WINE
2005
Springer
143views Economy» more  WINE 2005»
14 years 2 months ago
Economic Mechanisms for Shortest Path Cooperative Games with Incomplete Information
Abstract. In this paper we present a cooperative game theoretic interpretation of the shortest path problem. We consider a buying agent who has a budget to go from a specified sou...
T. S. Chandrashekar, Yadati Narahari
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
14 years 3 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...