866 search results - page 81 / 174 » On Dynamic Shortest Paths Problems |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
— Mobile ad hoc networks (MANETs) are dynamic wireless networks without any infrastructure. These networks are weak against many types of attacks. One of these attacks is the bla...
ICDCS
1999
IEEE
14 years 20 hour ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
TROB
2010
13 years 2 months ago
2010
Abstract--This paper proposes a unified optimization framework to solve the time parameterization problem of humanoid robot paths. Even though the time parameterization problem is ...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...