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...
Gespeichert in:
| Veröffentlicht in: | Journal of Computer Science and Technology |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Universidad Nacional de La Plata
2010
|
| Schlagworte: | |
| Online-Zugang: | https://www.redalyc.org/articulo.oa?id=638067314008 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|