4-(N2-1) Puzzle: Parallelization and performance on clusters
In this paper, an analysis of the 4-(N 2 -1) Puzzle, which is a generalization of the (N 2 -1) Puzzle, is presented. This problem is of interest due to its algorithmic and computational complexity and its applications to robot movements with several objectives. Taking the formal definition as a star...
Guardado en:
| Publicado en: | Journal of Computer Science and Technology |
|---|---|
| Autores principales: | , , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Universidad Nacional de La Plata
2010
|
| Materias: | |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=638067314008 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|