3 search results - page 1 / 1 » Online Dial-A-Ride Problem with Time Windows: An Exact Algor... |
OR
2006
Springer
13 years 4 months ago
2006
Springer
The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the ...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...