Sciweavers

708 search results - page 19 / 142
» Finding a Path to Model Consistency
Sort
View
ESA
2006
Springer
95views Algorithms» more  ESA 2006»
13 years 11 months ago
Resource Allocation in Bounded Degree Trees
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dro...
ICRA
1993
IEEE
104views Robotics» more  ICRA 1993»
13 years 11 months ago
Numerical Determination of Optimal Non-Holonomic Paths in the Presence of Obstacles
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...
Sudhaker Samuel, S. Sathiya Keerthi
DAC
2007
ACM
14 years 8 months ago
Global Critical Path: A Tool for System-Level Timing Analysis
An effective method for focusing optimization effort on the most important parts of a design is to examine those elements on the critical path. Traditionally, the critical path is...
Girish Venkataramani, Mihai Budiu, Tiberiu Chelcea...
19
Voted
INFOCOM
2010
IEEE
13 years 5 months ago
Sample Path Bounds for Long Memory FBM Traffic
Fractional Brownian motion (fBm) emerged as a useful model for self-similar and long-range dependent Internet traffic. Asymptotic, respectively, approximate performance measures ar...
Amr Rizk, Markus Fidler
DAM
1998
77views more  DAM 1998»
13 years 7 months ago
Optimal Wavelength-routed Multicasting
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
Bruno Beauquier, Pavol Hell, Stephane Perennes