The sweep-line method is an explicit-state model checking technique that uses a notion of progress to delete states from internal memory during state space exploration and thereby reduce peak memory usage. The sweep-line algorithm relies on the use of a priority queue where the progress value assigned to a state determines the priority of the state. In earlier implementations of the sweep-line ...

In this report a way to apply high level Blas to the tridiagonalization process of a symmetric matrix A is investigated. Tridiagonalization is a very important and work-intensive preprocessing step in eigenvalue computations. It also arises as a very central part of the material sciences code Wien 97 (Blaha et al. [12]). After illustrating the drawbacks and limitations of the tridiagonalization...

The full-domain “sweep,” in which all angular fluxes in a problem are calculated given previous-iterate values only for the volumetric source, forms the foundation for many iterative methods that have desirable properties [1]. One important property is that iteration counts do not grow with mesh refinement [1]. The sweep solution on parallel machines is complicated by the dependency of a given ...

We give an O(n log n)-time method for nding a best k-link piecewise-linear function approximating an n-point planar data set using the well-known uniform metric to measure the error, 0, of the approximation. Our method is based upon new characterizations of such functions, which we exploit to design an eecient algorithm using a plane sweep in \ space" followed by several applications of the par...

In some more complicated tasks the use of multiple robots can be advantageous, as there are some tasks that are just not achievable by a single robot. Teams of cooperating robots can accomplish more and faster than individual robots, as is the case in the intruder detection problem. Here, two off-line algorithms are presented for intruder detection in a known environment. In the first approach,...

This paper provides a new approach for power flow and modeling analysis of three phase unbalanced radial distribution systems (URDS) using the simple forward/backward sweep-based algorithm. A three phase load flow solution is proposed considering voltage regulator and transformer with detailed load modeling, for the transformer modeling symmetrical components theory is used and zero sequence-vo...

This paper presents a sweep based algorithm for the kdimensional cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks and k resources, this algorithm has a worst-case time complexity of O(kn) but scales well in practice. In greedy assignment mode, it handles up to 1 million tasks with 64 resources in one single constraint in SICStus. In ...

An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulati...