Sciweavers

138 search results - page 3 / 28
» Monitoring minimum cost paths on road networks
Sort
View
GIS
2008
ACM
14 years 6 months ago
Continuous proximity monitoring in road networks
In this paper, we consider the following scenario: a set of mobile objects continuously track their positions in a road network and are able to communicate with a central server. ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
TKDE
2002
239views more  TKDE 2002»
13 years 5 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
ACSAC
2003
IEEE
13 years 11 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
ICDCS
2010
IEEE
13 years 7 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
CONEXT
2008
ACM
13 years 6 months ago
A probabilistic model of k-coverage in minimum cost wireless sensor networks
One of the fundamental problems in the wireless sensor networks is the coverage problem. The coverage problem fundamentally address the quality of service (surveillance or monitor...
S. Ali Raza Zaidi, Maryam Hafeez, Desmond C. McLer...