Sciweavers

641 search results - page 42 / 129
» On robust online scheduling algorithms
Sort
View
ATMOS
2008
118views Optimization» more  ATMOS 2008»
13 years 9 months ago
Recoverable Robustness for Railway Rolling Stock Planning
Abstract. In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planni...
Valentina Cacchiani, Alberto Caprara, Laura Galli,...
ICONIP
2010
13 years 5 months ago
Online Gesture Recognition for User Interface on Accelerometer Built-in Mobile Phones
Recently, several smart phones are equipped with a 3D-accelerometer that can be used for gesture-based user interface (UI). In order to utilize the gesture UI for the real-time sys...
BongWhan Choe, Jun-Ki Min, Sung-Bae Cho
CORR
2002
Springer
92views Education» more  CORR 2002»
13 years 7 months ago
Source Routing and Scheduling in Packet Networks
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
Matthew Andrews, Antonio Fernández, Ashish ...
TITS
2011
150views more  TITS 2011»
13 years 2 months ago
Online Spatio-Temporal Risk Assessment for Intelligent Transportation Systems
—Due to modern pervasive wireless technologies and high-performance monitoring systems, spatio-temporal information plays an important role in areas such as intelligent transport...
Ondrej Linda, Milos Manic
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
13 years 9 months ago
Provably good multicore cache performance for divide-and-conquer algorithms
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...
Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B....