Sciweavers

2343 search results - page 262 / 469
» The Locomotive Routing Problem
Sort
View
SODA
2000
ACM
102views Algorithms» more  SODA 2000»
15 years 7 months ago
Escaping a grid by edge-disjoint paths
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
IWSOS
2009
Springer
16 years 1 months ago
Revisiting P2P Content Sharing in Wireless Ad Hoc Networks
Classical content sharing applications like BitTorrent are not designed to run over wireless networks. When adapting them to these constrained networks, two main problems arise. On...
Mohamed Karim Sbai, Chadi Barakat
ICCCN
2008
IEEE
16 years 29 days ago
Energy Minimization through Network Coding for Lifetime Constrained Wireless Networks
— Energy management is the key issue in the design and operation of wireless network applications like sensor networks, pervasive computing and ubiquitous computing where the net...
Nishanth Gaddam, Sudha Anil Gathala, David Lastine...
NETCOOP
2007
Springer
16 years 20 days ago
Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
Dominique Barth, Johanne Cohen, Loubna Echabbi, Ch...
IPPS
2005
IEEE
16 years 3 days ago
GUARD: Gossip Used for Autonomous Resource Detection
A growing trend in the development and deployment of grid computing systems is decentralization. Decentralizing these systems helps make them more scalable and robust, but poses s...
Sagnik Nandy, Larry Carter, Jeanne Ferrante