Sciweavers

70 search results - page 14 / 14
» Online Scheduling to Minimize the Maximum Delay Factor
Sort
View
STACS
2005
Springer
14 years 11 days ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
PODC
2009
ACM
14 years 7 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
MASS
2010
162views Communications» more  MASS 2010»
13 years 4 months ago
A metric for routing in delay-sensitive wireless sensor networks
Abstract--We present a new scheme to reduce the end-toend routing delay in the mission-critical applications of the wireless sensor networks (WSNs) under the duty cycle model. Whil...
Zhen Jiang, Jie Wu, Risa Ito
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 1 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
JSAC
2011
219views more  JSAC 2011»
13 years 1 months ago
Detection of Small-Scale Primary Users in Cognitive Radio Networks
Abstract—In cognitive radio networks (CRNs), detecting smallscale primary devices, such as wireless microphones, is a challenging, but very important, problem that has not yet be...
Alexander W. Min, Xinyu Zhang, Kang G. Shin