1594 search results - page 116 / 319 » An Algorithm to Compute Collusion Paths |
COR
2007
15 years 3 months ago
2007
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...
ICRA
2005
IEEE
15 years 8 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
132
click to vote
ATMOS
2009
15 years 4 months ago
2009
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
148
Voted
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
115
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...