• No se han encontrado resultados

4-(N2-1) Puzzle: parallelization and performance on clusters

N/A
N/A
Protected

Academic year: 2017

Share "4-(N2-1) Puzzle: parallelization and performance on clusters"

Copied!
10
0
0

Texto completo

Loading

Figure

Fig. 2. Boards for the 15 (N=4) Puzzle. a. Initial board. b. Final board.
Fig. 3. Examples of 5x5 boards. a. Configuration 1 b. Configuration 2.
Fig. 4. Best parallel times. a. Configuration 1 b. Configuration 2.

Referencias

Documento similar

We show that, when the real clusters are normally distributed, all the criteria are able to correctly assess the number of components, with AIC and BIC allowing a higher

The table below shows a summary of the performance of the different algorithms used in this work in the different types of problems tested, reporting the number of times that

selection and the best parameters are used to solve the Job-Shop Scheduling Problem through the Traveling Salesman Problem.. Different cases in the literature are solved to

In particular, the general hybrid framework for optimization problems with cardinality constraints and dimensionality reduction techniques are applied to the problems of finding

On the other hand at Alalakh Level VII and at Mari, which are the sites in the Semitic world with the closest affinities to Minoan Crete, the language used was Old Babylonian,

The gain of state space decomposition techniques with respect to the classical exact solution algorithm (solution of the underlying CTMC of the original model) is in both memory

This condition, related to the normal component on ∂D of the ∂-operator, permits us to study the Neumann problem for pluriharmonic functions and the ∂-problem for (0, 1)-forms on D

However, in broad and complex areas where a large number of long and close images from multiple stations are necessary, it is complicated to know the coordinates