Sciweavers

6004 search results - page 763 / 1201
» Parallelizing query optimization
Sort
View
HIPC
2004
Springer
15 years 9 months ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
ISPA
2004
Springer
15 years 9 months ago
A Congestion-Aware Search Protocol for Unstructured Peer-to-Peer Networks
Peer-to-Peer (P2P) file sharing is the hottest, fastest growing application on the Internet. When designing Gnutella-like applications, the most important consideration is the sca...
Kin Wah Kwong, Danny H. K. Tsang
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 9 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
EUROPAR
2001
Springer
15 years 8 months ago
Self-Organizing Hierarchical Cluster Timestamps
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
Paul A. S. Ward, David J. Taylor
WIDM
1999
ACM
15 years 8 months ago
An Efficient Plan Execution System for Information Management Agents
Recent work on information integration has yielded novel and efficient solutions for gathering data from the World Wide Web. However, there has been little attention given to the ...
Greg Barish, Dan DiPasquo, Craig A. Knoblock, Stev...