We investigate the formulation and implementation of new explicit group iterative methods in solving the two-dimensional Poisson equation with Dirichlet boundary conditions. The methods are derived from a fourth order compact nine point finite difference discretization. The methods are compared with the existing second order standard five point formula to show the dramatic improvement in comput...

New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the million queens. However, on highly constrained problems it is possible for these methods to get caught in local minima. In this paper we present genet, a connectionist architecture for solving binary and general constraint...

Move-based iterative improvement partitioning methods such as the Fiduccia-Mattheyses (FM) algorithm 3] and Krishnamurthy's Look-Ahead (LA) algorithm 4] are widely used in VLSI CAD applications largely due to their time eeciency and ease of implementation. This class of algorithms is of the \local improvement" type. They generate relatively high quality results for small and medium size circuit...