Sciweavers

1095 search results - page 129 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ICDE
1999
IEEE
134views Database» more  ICDE 1999»
15 years 11 months ago
On Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We hav...
Davood Rafiei
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
AIPS
2008
15 years 7 days ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams
IDEAS
2002
IEEE
223views Database» more  IDEAS 2002»
15 years 2 months ago
Energy-Efficient Data Broadcasting in Mobile Ad-Hoc Networks
Energy saving is the most important issue in wireless mobile computing due to power constraints on mobile units. Data broadcasting is the main method of information dissemination ...
Le Gruenwald, Muhammad Javed, Meng Gu
DBPL
2007
Springer
101views Database» more  DBPL 2007»
15 years 1 months ago
Efficient Inclusion for a Class of XML Types with Interleaving and Counting
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani