Sciweavers

262 search results - page 29 / 53
» Optimal Pricing in Networks with Externalities
Sort
View
IPPS
1999
IEEE
15 years 2 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
CONEXT
2010
ACM
14 years 7 months ago
Simple yet efficient, transparent airtime allocation for TCP in wireless mesh networks
In this paper, we explore a simple yet effective technique for explicitly allocating airtime to each active pair of communicating neighbors in a wireless neighborhood so that TCP ...
Ki-Young Jang, Konstantinos Psounis, Ramesh Govind...
COMAD
2009
14 years 11 months ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
ICNP
1998
IEEE
15 years 2 months ago
Distributed Network Flow Control based on Dynamic Competitive Markets
Network applications require a certain level of network performance for their proper operation. These individual guarantees can be provided if su cient amounts of network resource...
Errin W. Fulp, Douglas S. Reeves
STOC
2003
ACM
137views Algorithms» more  STOC 2003»
15 years 10 months ago
Near-optimal network design with selfish agents
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
Elliot Anshelevich, Anirban Dasgupta, Éva T...