Related papers: Acerca del Algoritmo de Dijkstra
We establish an algorithm to encrypt and decrypt messages, where messages can be seen as elements of a finite field, using of mutations in a cluster algebra finite type.
In this paper we discuss certain theoretical properties of algorithm selection approach to image processing and to intelligent system in general. We analyze the theoretical limits of algorithm selection with respect to the algorithm…
In this research, an optimal algorithm for the Collatz conjecture is presented. Properties such as the convergence of the algorithm and an equation that relates the algorithm to the classical Collatz conjecture are obtained. It is validated…
By suitable examples we illustrate an algorithm for composition of inverse problems.
We proposed an algorithm that covers some cases of Hamilton Circuit Problem.
Algorithm design is a laborious process and often requires many iterations of ideation and validation. In this paper, we explore automating algorithm design and present a method to learn an optimization algorithm, which we believe to be the…
We are given a directed graph $G = (V,E)$ with $n$ vertices and $m$ edges, with positive weights on the edges, and a parameter $k >0$. We show how to compute, for every vertex $v \in V$, its $k$ nearest-neighbors. The algorithm runs in $O(…
The correctness of a structured program is, at best, plausible. Though this is a step forward compared to what came before, it falls short of verified correctness. To verify a structured program according to Hoare's method one is faced with…
An algorithm is described that enables efficient deterministic approximate computation of the bootstrap distribution for any linear bootstrap method $T_n^*$, alleviating the need for repeated resampling from observations (resp.…
Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of…
A numerical scheme is presented to solve the one source near field refractor problem to arbitrary precision and it is proved that the scheme terminates in a finite number of iterations. The convergence of the algorithm depends upon proving…
We prove a version of adelic descent for continuous localizing invariants.
We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing. We uncover incompletenesses in existing…
Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds…
This is a new version of our previous work. In this version, we fill a gap included in the original proof of Theorem 1.1 in our previous paper entitled "An iterative method for Kirchhoff type equations and its applications".
As a fundamental topic in graph mining, Densest Subgraph Discovery (DSD) has found a wide spectrum of real applications. Several DSD algorithms, including exact and approximation algorithms, have been proposed in the literature. However,…
Our paper presents an attempt to axiomatise signal processing. Our long-term goal is to formulate signal processing algorithms for an ideal world of exact computation and prove properties about them, then interpret these ideal formulations…
We show that the higher-order matching problem is decidable using a game-theoretic argument.
This paper investigates the parallelization of Dijkstra's algorithm for computing the shortest paths in large-scale graphs using MPI and CUDA. The primary hypothesis is that by leveraging parallel computing, the computation time can be…
In this paper we prove the WALA conjecture.