1480 search results - page 182 / 296 » Distributed algorithms for weighted problems in sparse graph... |
156
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
158
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
139
click to vote
ESOP
2006
Springer
15 years 6 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
123
click to vote
ICIAP
1999
ACM
15 years 7 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
119
click to vote
HEURISTICS
2008
15 years 3 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...