نتایج جستجو برای: fibonacci hypercube
تعداد نتایج: 6802 فیلتر نتایج به سال:
Hypercube structures are heavily used by parallel algorithms that require all-to-all communication. When communicating over a heterogeneous network, which may be the case in NOWs or GRID environments, the performance obtained by the hypercube structure will depend on the matching of the hypercube structure to the topology of the underlying network. In this paper, we present strategies to build ...
We propose an approach to constructing nested Latin hypercube designs. Such designs are useful for conducting multiple computer experiments with different levels of accuracy. A nested Latin hypercube design with two layers is defined to be a special Latin hypercube design that contains a smaller Latin hypercube design as a subset. Our method is easy to implement and can accommodate any number o...
The purpose of embedding (or mapping) is to minimize the communication overhead of parallel algorithms. It appears unlikely that an efficient exact technique of embedding a general guest graph in a general host graph with a minimum-dilation will ever be found. The Research in this area is concentrating on discovering efficient heuristic that find solution in most cases. This article is a survey...
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the expressions of Fibonacci graphs and eventually find their shortest representations. With that end in view, we describe the optimal decomposition method for generati...
In this paper we consider certain generalizations of the well-known Fibonacci and Lucas numbers, the generalized Fibonacci and Lucas p-numbers. We give relationships between the generalized Fibonacci p-numbers, Fp(n), and their sums, Pn i1⁄41F pðiÞ, and the 1-factors of a class of bipartite graphs. Further we determine certain matrices whose permanents generate the Lucas p-numbers and their sum...
Although it has been studied extensively, Pascal's triangle remains fascinating to explore and there always seems to be some new aspects that are revealed by looking at it closely. In this paper we shall examine a few nice properties of the so-called Fibonacci diagonals, that is, those slant lines whose entries sum to consecutive terms of the Fibonacci sequence. We adopt throughout our text the...
In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable assumptions, there exist sequences of n Insert, n Delete, m DecreaseKey and t FindMin operations, where 1 ≤ t ≤ n, which have Ω(nlogt + n + m) complexity. Although Fibonacci heaps do not achieve this bound, we present a modified Fibonacci heap which does, and so is optim...
The generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all vertices that contain a given binary word f as a factor; the generalized Lucas cube Qd( ↽Ð f ) is obtained from Qd by removing all the vertices that have a circulation containing f as a factor. In this paper the Wiener index of Qd(1) and the Wiener index of Qd( ↽Ð 1) are expressed as functions of the o...
What is the ANZL Algorithm? It is a genuine result of our work which is theoretically and practically proved. By using the ANZL Algorithm, we can test whether a given number belongs to Lucas’s series. It can also be used to find a sequence of Lucas’s numbers, starting from any number . If a given number completes the relation , we can say that it is a Lucas number and we mark it as . From the p...
Coupled Fibonacci sequences of lower order have been generalized in number of ways.In this paper the Multiplicative Coupled Fibonacci Sequence has been generalized for r t h order with some new interesting properties. MSC: 11B39 • 11B37 • 11B99
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید