597 search results - page 26 / 120 » Homomorphisms of random paths |
120
click to vote
ANCS
2009
ACM
15 years 11 days ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
135
click to vote
BCS
2008
15 years 4 months ago
2008
Much of the traffic carried by Sensor Networks will originate from routine measurements or observations by sensors which monitor a particular situation, such as the temperature an...
107
Voted
ICRA
2009
IEEE
15 years 9 months ago
2009
IEEE
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...
125
Voted
ASIAMS
2007
IEEE
15 years 9 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
148
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...