Sciweavers

4313 search results - page 43 / 863
» Using time travel to diagnose computer problems
Sort
View
SAC
2002
ACM
14 years 9 months ago
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
In this paper, we propose a metaheuristic based on snneedinglikerestarts to diversifyand intensifylocalsearches for solving the vehicle muting problem with time windows (VR_PTW). ...
Haibing Li, Andrew Lim
ICDE
2002
IEEE
164views Database» more  ICDE 2002»
15 years 11 months ago
Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
Charu C. Aggarwal
AVI
2006
14 years 11 months ago
Mobility agents: guiding and tracking public transportation users
Increasingly, public transportation systems are equipped with Global Positioning Systems (GPS) connected to control centers through wireless networks. Controllers use this infrast...
Alexander Repenning, Andri Ioannidou
IPPS
1999
IEEE
15 years 2 months ago
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
Warren Smith, Valerie E. Taylor, Ian T. Foster
IRREGULAR
1995
Springer
15 years 1 months ago
Run-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, E...