Sciweavers

8933 search results - page 270 / 1787
» Usability over time
Sort
View
MFCS
2005
Springer
16 years 5 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
ISORC
2003
IEEE
15 years 12 months ago
Enhancing Time Triggered Scheduling with Value Based Overload Handling and Task Migration
Time triggered methods provide deterministic behaviour suitable for critical real-time systems. They perform less favourably, however, if the arrival times of some activities are ...
Jan Carlson, Tomas Lennvall, Gerhard Fohler
DSRT
2008
IEEE
15 years 8 months ago
Lightweight Time Warp - A Novel Protocol for Parallel Optimistic Simulation of Large-Scale DEVS and Cell-DEVS Models
This paper proposes a novel Lightweight Time Warp (LTW) protocol for high-performance parallel optimistic simulation of large-scale DEVS and CellDEVS models. By exploiting the cha...
Qi Liu, Gabriel A. Wainer
VLDB
2002
ACM
126views Database» more  VLDB 2002»
15 years 6 months ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh
INFOCOM
2010
IEEE
15 years 5 months ago
Recognizing Exponential Inter-Contact Time in VANETs
—Inter-contact time between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs) and central to forwarding algorithms and the end-to-end delay. Due to ...
Hongzi Zhu, Luoyi Fu, Guangtao Xue, Yanmin Zhu, Mi...