625 search results - page 32 / 125 » Approximating Travel Times Using Opportunistic Networking |
JSSPP
2005
Springer
15 years 5 months ago
2005
Springer
The recent success of Internet-based computing projects, coupled with rapid developments in peer-to-peer systems, has stimulated interest in the notion of harvesting idle cycles u...
103
click to vote
MOBISYS
2008
ACM
15 years 11 months ago
2008
ACM
This paper investigates an application of mobile sensing: detecting and reporting the surface conditions of roads. We describe a system and associated algorithms to monitor this i...
CJ
2010
14 years 12 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
190
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
We introduce a convoy query that retrieves all convoys from historical trajectories, each of which consists of a set of objects that travelled closely during a certain time period....
HM
2009
Springer
15 years 4 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....