3678 search results - page 87 / 736 » On the Stable Paths Problem |
ATMOS
2010
14 years 11 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
80
Voted
JMIV
2006
15 years 20 days ago
2006
This paper studies the multi-solution phenomenon for the perspective four point (P4P) problem from geometric and algebraic aspects. We give a pure geometric proof that the P4P pro...
110
Voted
BCS
2008
15 years 2 months ago
2008
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
129
click to vote
ADCM
2011
14 years 7 months ago
2011
ABSTRACT. In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric pro...
119
Voted
ECP
1997
Springer
15 years 4 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...