This paper investigates the application of the Red-Black Half-Sweep Gauss-Seidel (HSGS-RB) method by using the half-sweep triangle finite element approximation equation based on the Galerkin scheme to solve two-dimensional Poisson equations. Formulations of the full-sweep and half-sweep triangle finite element approaches in using this scheme are also derived. Some numerical experiments are cond...

Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated VRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time...

In this paper we describe a simple parallelization of the ZSWEEP algorithm for rendering unstructured volumetric grids on distributed-shared memory machines, and study its performance on three generations of SGI multiprocessors, including the new Origin 3000 series. The main idea of the ZSWEEP algorithm is very simple; it is based on sweeping the data with a plane parallel to the viewing plane,...

This paper proposes a novel spectrum estimation algorithm in order to extract the Doppler information of segment echo data of high frequency surface wave radar (HFSWR) operating at sweep frequency mode. Working in this mode, the HFSWR can avoid interferences related to radar frequency, such as ionospheric clutter, sea clutter, and cochannel interference. However, the echo signals operating at t...

Cumulative is an essential constraint in the CP framework, and is present in scheduling and packing applications. The lightest filtering for the cumulative constraint is time-tabling. It has been improved several times over the last decade. The best known theoretical time complexity for time-table is O(n logn) introduced by Ouellet and Quimper. We show a new algorithm able to run in O(n), by re...

We present a novel approach to perform collision detection queries between rigid and/or deformable models. Our method can handle arbitrary deformations and even discontinuous ones. For this, we subdivide the whole scene with all objects into connected but totally independent parts by a fuzzy clustering algorithm. Following, for every part our algorithm performs a Principal Component Analyses to...

In this paper we describe a simple parallelization of the ZSWEEP algorithm for rendering unstructured volumetric grids on distributed-shared memory machines, and study its performance on three generations of SGI multiprocessors, including the new Origin 3000 series. The main idea of the ZSWEEP algorithm is very simple; it is based on sweeping the data with a plane parallel to the viewing plane,...

This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iteration, which enables the computation of all Jacobi rotations of a sweep in parallel. One key point of our proposed block JRS algorithm is reusing the loaded data into cache memory by performing computations on matrix ...

In this paper, we examine the intuition that TD( ) is meant to operate by approximating asynchronous value iteration. We note that on the important class of discrete acyclic stochastic tasks, value iteration is ine cient compared with the DAG-SP algorithm, which essentially performs only one sweep instead of many by working backwards from the goal. The question we address in this paper is wheth...

The aim of this paper is to introduce a hybrid two-phase algorithm called SW+ ASelite for solving the MTSP which can be explained as the problem of designing collection of routes from one depot to a number of customers subject to side constraints. At the first stage, the MTSP is solved by the sweep algorithm, and at the second stage, the Elite Ant Colony Optimization ( ASelite ) and 3-opt local...