597 search results - page 38 / 120 » Homomorphisms of random paths |
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...
WEA
2004
Springer
15 years 3 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, ...
KI
2001
Springer
15 years 2 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...
83
Voted
RAS
2002
14 years 9 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...
TALG
2010
14 years 8 months ago
2010
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...