14 search results - page 1 / 3 » Path smoothing via discrete optimization |
DAC
2008
ACM
14 years 5 months ago
2008
ACM
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...
ICMCS
2007
IEEE
13 years 10 months ago
2007
IEEE
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
ISRR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present an interpolation-based planning and replanning algorithm for generating smooth paths through non-uniform cost grids. Most grid-based path planners use discrete...
HPCC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...