Results 11  20
of
7,792
On the Paths Length in Interval Routing Schemes
, 1996
"... In this paper, the problem of routing messages in a distributed network without using complete routing tables is considered. Interval Labeling Schemes (ILS) are analyzed and new lower bounds on the length of the routed paths are provided. In particular, it is shown that if k 0:05 n D log(n=D) inte ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper, the problem of routing messages in a distributed network without using complete routing tables is considered. Interval Labeling Schemes (ILS) are analyzed and new lower bounds on the length of the routed paths are provided. In particular, it is shown that if k 0:05 n D log
On the internal path length of ddimensional quad trees
, 1999
"... It is proved that the internal path length of a d–dimensional quad tree after normalization converges in distribution. The limiting distribution is characterized as a fixed point of a random affine operator. We obtain convergence of all moments and of the Laplace transforms. The moments of the limit ..."
Abstract

Cited by 21 (10 self)
 Add to MetaCart
It is proved that the internal path length of a d–dimensional quad tree after normalization converges in distribution. The limiting distribution is characterized as a fixed point of a random affine operator. We obtain convergence of all moments and of the Laplace transforms. The moments
Binary Decision Diagram with Minimum Expected Path Length
 Proc. DATE 01
, 2001
"... We present methods to generate a Binary Decision Diagram (BDD) with minimum expected path length. A BDD is a generic data structure which is widely used in several fields. One important application is the representation of Boolean functions. A BDD representation enables us to evaluate a Boolean func ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We present methods to generate a Binary Decision Diagram (BDD) with minimum expected path length. A BDD is a generic data structure which is widely used in several fields. One important application is the representation of Boolean functions. A BDD representation enables us to evaluate a Boolean
Streamlining Traceroute by Estimating Path Lengths
 Proc. IEEE Int’l. Wksp. IP Operations and Management (IPOM
, 2004
"... Abstract — Traditional traceroute determines the path through a network by sending probe packets with progressively increasing TTL/hop count values so that routers that are progressively further from the inquirer send ICMP Time Exceeded messages and so reveal their identity. This process can be slow ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
by the inquirer sending a scout packet to the (reachable) target before sending route tracing probes. The inquirer uses the TTL of the response to this scout packet to estimate the length of the path to the target (with tolerance for path asymmetry), and can then either expedite the route tracing process (by
Clustering techniques for minimizing external path length
 Proceedings of the International Conference on Very Large Databases
, 1996
"... There are a variety of mainmemory access structures, such as segment trees, and quad trees, whose properties, such as good worstcase behaviour, make them attractive for database applicdions. Unfortunately, the structures are typically ‘long and skinny’, whereas disk data structuies must be ‘short ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
in a path is called the external path length. We address several versions of the clustering problem. We present a clustering algorithm for tree structures that generates optimal worstcase external path length mappings; we also show how to make it dynamic, to support updates. We extend the al
Pathlength analysis of objectoriented programs
 In Proc. EAAI
, 2006
"... Abstract. This paper describes a new static analysis for finding approximations to the pathlength of variables in imperative, objectoriented programs. The pathlength of a variable v is the cardinality of the longest chain of pointers that can be followed from v. It is shown how such information m ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. This paper describes a new static analysis for finding approximations to the pathlength of variables in imperative, objectoriented programs. The pathlength of a variable v is the cardinality of the longest chain of pointers that can be followed from v. It is shown how such information
On the Relationship of Tornado Path Length and Wind to Intensity
 Weather and Forecasting
"... Reported path lengths and widths of tornadoes have been modeled using Weibull distributions for different Fujita (F) scale values. The fits are good over a wide range of lengths and widths. Path length and width tend to increase with increasing F scale, although the temporal nonstationarity of the d ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
Reported path lengths and widths of tornadoes have been modeled using Weibull distributions for different Fujita (F) scale values. The fits are good over a wide range of lengths and widths. Path length and width tend to increase with increasing F scale, although the temporal nonstationarity
Estimating Shortest Circuit Path Length Complexity
"... Abstract—When binary decision diagrams are formed from uniformly distributed Monte Carlo data for a large number of variables, the complexity of the decision diagrams exhibits a predictable relationship to the number of variables and minterms. In the present work, a neural network model has been use ..."
Abstract
 Add to MetaCart
used to analyze the pattern of shortest path length for larger number of Monte Carlo data points. The neural model shows a strong descriptive power for the ISCAS benchmark data with an RMS error of 0.102 for the shortest path length complexity. Therefore, the model can be considered as a method
On the joint path length distribution in random binary trees
 Stud. Appl. Math
"... During the 10th Seminar on Analysis of Algorithms, MSRI, Berkeley, June 2004, Knuth posed the problem of analyzing the left and the right path length in a random binary trees. In particular, Knuth asked about properties of the generating function of the joint distribution of the left and the right p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
During the 10th Seminar on Analysis of Algorithms, MSRI, Berkeley, June 2004, Knuth posed the problem of analyzing the left and the right path length in a random binary trees. In particular, Knuth asked about properties of the generating function of the joint distribution of the left and the right
Results 11  20
of
7,792