3678 search results - page 163 / 736 » On the Stable Paths Problem |
115
Voted
WEA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
137
Voted
KI
2001
Springer
15 years 8 months ago
2001
Springer
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
136
click to vote
RAS
2002
15 years 3 months ago
2002
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
156
Voted
TON
1998
15 years 3 months ago
1998
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
171
Voted
WINE
2010
Springer
15 years 1 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...