Sciweavers

625 search results - page 118 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
14 years 4 months ago
Consensus-based distributed linear filtering
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
Ion Matei, John S. Baras
WWW
2001
ACM
15 years 10 months ago
Integrating Software Agents into the HTTP Caching Infrastructure
Mobile software agents are an increasingly important programming model within the World Wide Web (WWW). Typically programmed in Java or another machine- independent language, the ...
Jesse Greenwald, Daniel Andresen
PODS
2006
ACM
122views Database» more  PODS 2006»
15 years 9 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
99
Voted
ROBOCOMM
2007
IEEE
15 years 3 months ago
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
IPPS
2003
IEEE
15 years 2 months ago
On Self-Similarity and Hamiltonicity of Dual-Cubes
The dual-cube is a newly proposed topology for interconnection networks, which uses low dimensional hypercubes as building blocks. The primary advantages of the dual-cube over the...
Changfu Wu, Jie Wu