We have proposed a parallel simulated annealing using genetic crossover as one of powerful conformational search methods, in order to find the global minimum energy structures for protein systems. The simulated annealing using genetic crossover method, which incorporates the attractive features of the simulated annealing and the genetic algorithm, is useful for finding a minimum potential energ...

This paper describes a method for the automatic alignment of parallel texts at clause level. The method features statistical techniques coupled with shallow linguistic processing. It presupposes a parallel bilingual corpus and identifies alignments between the clauses of the source and target language sides of the corpus. Parallel texts are first statistically aligned at sentence level and then...

An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...

This paper proposes Parallel Simulated Annealing using Genetic Crossover (PSA/GAc). In this algorithm, there are several processes of Simulated Annealing (SA) working parallel. To exchange information between the solutions, the operation of genetic crossover is performed. Through the continuous test problems, it is found that PSA/GAc can search the solution effectively. The proposed algorithm i...

Since many years algorithms from the eld of arti cial intelligence (AI) have been targeted for parallelization, i.e., partitioning the search problem and distributing the subproblems among multiple processing nodes. This paper reports on our experience in parallelizing and distributing AI algorithms, i.e., the design and prototype implementation of parallel computer architectures for AI algorit...

An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...

Concurrent computing can be applied to heuristic methods for combinatorial optimization to shorten computation time, or equivalently, to improve the solution when time is fixed. This paper presents several communication schemes for parallel simulated annealing, focusing on a combination of OpenMP nested in MPI. Strikingly, even though many publications devoted to either intensive or sparse comm...

In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments show usefulness of the parallel GA and SA algorithms.

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for real-life problems has been limited by the long execution time. This report presents a new approach to asynchronous simulated annealing for parallel thread oriented multiprocessor operating systems. Experimental results of the 100to 1000-city traveling salesman problems on the two-proce...