3678 search results - page 100 / 736 » On the Stable Paths Problem |
108
click to vote
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
112
Voted
FUN
2007
Springer
15 years 4 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
71
Voted
KIVS
2005
Springer
15 years 6 months ago
2005
Springer
: In our current work with the Chord protocol [SMK+ 01] we had to decide whether to use iterative or recursive routing. Iterative routing provides the initiating node with a lot of...
87
Voted
GI
2009
Springer
14 years 10 months ago
2009
Springer
: An operational Air Surveillance System shall generate a stable and reliable air picture. In dense target situations the quality of available sensor data is reduced. System models...
87
Voted
TON
2002
15 years 11 days ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...