279 search results - page 42 / 56 » Reduction approaches for robust shortest path problems |
SIGCOMM
1999
ACM
15 years 1 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
67
Voted
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and visual recognition. However, such descriptors are generally par...
93
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
72
Voted
AMAI
2008
Springer
14 years 9 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...