364 search results - page 24 / 73 » Shortest-path network interdiction |
128
click to vote
SIGMOD
2004
ACM
15 years 8 months ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
113
click to vote
NIPS
1993
15 years 4 months ago
1993
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
140
click to vote
IWANN
1997
Springer
15 years 7 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
129
click to vote
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
This paper presents a new method to extract a network of vessels centerlines from a medical
image. The network is composed of local geodesics over a four-dimensional space that in...
110
Voted
NOMS
2000
IEEE
15 years 7 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...