Sciweavers

597 search results - page 27 / 120
» Homomorphisms of random paths
Sort
View
108
Voted
MOR
2000
162views more  MOR 2000»
14 years 9 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
JGT
2010
81views more  JGT 2010»
14 years 8 months ago
Cycles and paths in edge-colored graphs with given degrees
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
A. Abouelaoualim, Kinkar Chandra Das, Wenceslas Fe...
CPC
2002
80views more  CPC 2002»
14 years 9 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
DAC
2002
ACM
15 years 10 months ago
False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
Jing-Jia Liou, Angela Krstic, Li-C. Wang, Kwang-Ti...
ICRA
2007
IEEE
144views Robotics» more  ICRA 2007»
15 years 4 months ago
Particle RRT for Path Planning with Uncertainty
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
Nik A. Melchior, Reid G. Simmons