Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto


Mostrar registro sencillo 2010-06-14T13:38:28Z 2010-06-14T03:00:00Z 2010-06
dc.description.abstract In this paper, an analysis of the 4-(N2-1) Puzzle, which is a generalization of the (N2-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 starting point, 4 heuristics that can be used to predict the best achievable objective and to estimate the number of steps required to reach a solution state from a given configuration are analyzed. By selecting the objective, a sequential and parallel solution over a cluster is presented for the (N2-1) Puzzle, based on the heuristic search algorithm A*. Also, variations of the classic heuristic are analyzed. The experimental work focuses on analyzing the possible superlinearity and the scalability of the parallel solution on clusters, by varying the physical configuration and the dimension of the problem. Finally, the suitability of the heuristic used to assess the best achievable objective in the 4-(N2-1) Puzzle is analyzed. en
dc.format.extent p. 86-90 es
dc.language en es
dc.title 4-(N2-1) puzzle: parallelization and performance on clusters en
dc.type Articulo es
sedici.identifier.uri es
sedici.identifier.issn 1666-6038 es
sedici.creator.person Sanz, Victoria María es
sedici.creator.person De Giusti, Armando Eduardo es
sedici.creator.person Naiouf, Marcelo es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es Facultad de Informática es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
sedici.description.peerReview peer-review es
sedici2003.identifier ARG-UNLP-ART-0000006137 es
sedici.relation.journalTitle Journal of Computer Science & Technology es
sedici.relation.journalVolumeAndIssue vol. 10, no. 2 es
sedici.subject.acmcss98 Parallel algorithms es
sedici.subject.acmcss98 Optimization es

Descargar archivos

Este ítem aparece en las siguientes colecciones:

Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)