Search Results

Our research is an extension of the modeling theory framework proposed by Hestenes [1]. An exploratory study examined how Computer Science (CS) students use mental and conceptual models to solve real-world problems using graph algorithmic concepts. The ...

Zones and Octagons are popular abstract domains for static program analysis. They enable the automated discovery of simple numerical relations that hold between pairs of program variables. Both domains are well understood mathematically but the detailed ...

Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared state, which gets updated progressively. While the sequential variant of ...

Over the last years, the interest in preserving digitally ancient documents has increased resulting in databases with a huge amount of image data. Most of these documents are not transcribed and thus querying operations are limited to basic ...

We present I/O-efficient single-source shortest path algorithms for undirected graphs. Our main result is an algorithm with I/O complexity O(√(nmlog L)/B+MST(n, m)) on graphs with n vertices, m edges, and arbitrary edge lengths between 1 and L; MST(n, m ...

Modern microprocessors are becoming increasingly parallel devices, and GPUs are at the leading edge of this trend. Designing parallel algorithms for manycore chips like the GPU can present interesting challenges, particularly for computations on sparse ...

We consider bipartite matching algorithms for computing permutations of a sparse matrix so that the diagonal of the permuted matrix has entries of large absolute value. We discuss various strategies for this and consider their implementation as computer ...

Imagine a tourist rents a car and plans to drive around a city. Before going from one place to another, he/she needs to know a good way. In network theory, this is the shortest path problem. Shortest path algorithms are often used to solve the problem. ...

Presents parallel NC algorithms for all pair shortest path problem with optimal processor time product and single source shortest path problem with near optimal processor time product in k-chordal graphs. The algorithm for all pair problem runs in O(log/...

The Thresh X2 algorithm has been shown to dominate other shortest path algorithms over a wide variety of conditions. When used on random networks which have exponentially or normally distributed edge weights the performance of X2 degrades. We develop ...

This paper addresses the problem of assigning the modules of a distributed program to the processors of a distributed system. The goal of such an assignment is to minimize the total execution and communication costs. A computational model of a ...

This paper presents six new variants of the polynomially bounded Partitioning Shortest Path PSP algorithm for finding the shortest path from one node to all other nodes in a network. Three of these variants, one for negative arc lengths, but without ...

The paper introduces three extensions of the A* search algorithm which improve the search efficiency by relaxing the admissibility condition. 1) A* employs an admissible heuristic function but invokes quicker termination conditions while still ...