2796 search results - page 148 / 560 » The coolest path problem |
161
click to vote
AROBOTS
1998
15 years 4 months ago
1998
This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic...
107
click to vote
COMCOM
2006
15 years 5 months ago
2006
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
154
click to vote
JAL
2006
15 years 5 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 ...
156
click to vote
JCO
2007
15 years 5 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
139
click to vote
SIROCCO
2004
15 years 6 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...