نتایج جستجو برای: fibonacci search
تعداد نتایج: 297879 فیلتر نتایج به سال:
This paper examines a practical transportation model known as the Open Vehicle Routing Problem (OVRP). OVRP aims at designing the minimum cost set of routes originating from a central depot for satisfying customer demand. Vehicles do not need to return to the depot after completing their delivery services. In methodological terms, we propose an innovative local search metaheuristic which examin...
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
Using a tight-binding model and transfer-matrix technique, as well as Lanczos algorithm, we numerically investigate the nature of the electronic states and electron transmission in site, bond and mixing Fibonacci model chains. We rely on the Landauer formalism as the basis for studying the conduction properties of these systems. Calculating the Lyapunov exponent, we also study the localization...
In this paper, we define the Fibonacci–Jacobsthal, Padovan–Fibonacci, Pell–Fibonacci, Pell–Jacobsthal, Padovan–Pell and Padovan–Jacobsthal sequences which are directly related with Fibonacci, Jacobsthal, Pell Padovan numbers give their structural properties by matrix methods. Then obtain new relationships between numbers.
This paper studies the problem of obtaining depth information from focusing and defocusing, which have long been noticed as important sources of depth information for human and machine vision. In depth from focusing, we try to eliminate the local maxima problem which is the main source of inaccuracy in focusing; in depth from defocusing, a new computational model is proposed to achieve higher a...
The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibonacci cubes as its special cases. The postal network can also be considered as a flexible version of the hypercube which relaxes the restriction on the number of nodes and thus makes it possible to construct multicompute...
We show that the Conway polynomials of Fibonacci links are Fibonacci polynomials modulo 2. We deduce that, when n 6≡ 0 (mod 4) and (n, j) 6= (3, 3), the Fibonacci knot F (n) j is not a Lissajous knot. keywords: Fibonacci polynomials, Fibonacci knots, continued fractions
the objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a fibonacci hypercube structure. most of the popular algorithms for parallel matrix multiplication can not run on fibonacci hypercube structure, therefore giving a method that can be run on all structures especially fibonacci hypercube structure is necessary for parallel matr...
In this paper, firstly, we introduce the Ql-Generating matrix for the bi-periodic Lucas numbers. Then, by taking into account this matrix representation, we obtain some properties for the bi-periodic Fibonacci and Lucas numbers.
This paper will explore the relationship between the Fibonacci numbers and the Euclidean Algorithm in addition to generating a generalization of the Fibonacci Numbers. It will also look at the ratio of adjacent Fibonacci numbers and adjacent generalized Fibonacci numbers. Finally it will explore some fun applications and properties of the Fibonacci numbers.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید