Sciweavers

540 search results - page 9 / 108
» Competitive Routing over Time
Sort
View
ALGORITHMICA
2005
92views more  ALGORITHMICA 2005»
13 years 9 months ago
Average-Case Competitive Analyses for Ski-Rental Problems
Let s be the ratio of the cost for purchasing skis over the cost for renting them. Then the famous result for the ski-rental problem shows that skiers should buy their skis after r...
Hiroshi Fujiwara, Kazuo Iwama
ICDCS
2011
IEEE
12 years 8 months ago
Competitive and Fair Medium Access Despite Reactive Jamming
Abstract—Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often...
Andréa W. Richa, Christian Scheideler, Stef...
IJAHUC
2007
66views more  IJAHUC 2007»
13 years 9 months ago
A time-slot leasing-based QoS routing protocol over Bluetooth WPANs
: In this paper, we investigate a new efficient QoS routing protocol based on the time-slot leasing mechanism over Bluetooth WPANs. The “transmission holding” problem is incurr...
Yuh-Shyan Chen, Tsung-Hung Lin
PPSN
2010
Springer
13 years 7 months ago
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
Abel Garcia-Najera, John A. Bullinaria
INFOCOM
2003
IEEE
14 years 2 months ago
Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman, L...