625 search results - page 123 / 125 » Approximating Travel Times Using Opportunistic Networking |
ETT
2002
13 years 5 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
GIS
2010
ACM
13 years 3 months ago
2010
ACM
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
HPDC
2007
IEEE
13 years 11 months ago
2007
IEEE
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...
INFOCOM
1998
IEEE
13 years 9 months ago
1998
IEEE
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
SRDS
2008
IEEE
13 years 11 months ago
2008
IEEE
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...