1172 search results - page 121 / 235 » Path Algorithms on Regular Graphs |
134
click to vote
JAL
2006
15 years 2 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
117
Voted
IJRR
2002
15 years 2 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
133
Voted
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
141
Voted
MM
2009
ACM
15 years 9 months ago
2009
ACM
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
109
Voted
BROADNETS
2006
IEEE
15 years 8 months ago
2006
IEEE
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...