552 search results - page 57 / 111 » Constrained Shortest Path Computation |
IDA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
EMMCVPR
2007
Springer
15 years 3 months ago
2007
Springer
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— This paper presents a new method for planning motions of multi-arm systems in constrained workspaces, for which state-of-the-art planners behave poorly. The method is based on ...
GLVLSI
2009
IEEE
15 years 4 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
PODS
2003
ACM
15 years 10 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...