Mostrar el registro sencillo del ítem
Easily Solving Dynamic Programming Problems in Haskell by Memoization of Hylomorphisms
dc.contributor.author | Llorens, David | |
dc.contributor.author | Vilar Torres, Juan Miguel | |
dc.date.accessioned | 2021-01-13T15:06:54Z | |
dc.date.available | 2021-01-13T15:06:54Z | |
dc.date.issued | 2020 | |
dc.identifier.citation | LLORENS, David; VILAR, Juan Miguel. Easily solving dynamic programming problems in Haskell by memoization of hylomorphisms. Software: Practice and Experience, 2020, vol. 50, núm. 12, p. 2193-2211 | ca_CA |
dc.identifier.issn | 0038-0644 | |
dc.identifier.issn | 1097-024X | |
dc.identifier.uri | http://hdl.handle.net/10234/191226 | |
dc.description.abstract | Dynamic Programming is a well known algorithmic technique that solves problems by a combination of dividing a problem into subproblems and using memoization to avoid an exponential growth of the costs. We show how to implement Dynamic Programming in Haskell using a variation of hylomorphisms that includes memoization. Our implementation uses polymorphism so the same function can return the best score or the solution to the problem based on the type of the returned value. | ca_CA |
dc.format.extent | 17 p. | ca_CA |
dc.format.mimetype | application/pdf | ca_CA |
dc.language.iso | eng | ca_CA |
dc.publisher | Wiley | ca_CA |
dc.relation.isPartOf | Software: Practice and Experience, 2020, vol. 50, núm. 12, p. 2193-2211 | ca_CA |
dc.rights | "This is the pre-peer reviewed version of the following article: Llorens D, Vilar JM. Easily solving dynamic programming problems in Haskell by memoization of hylomorphisms. Software: Practice and Experience, 50-12. 2020, which has been published in final form at https://doi.org/10.1002/spe.2887. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions." | ca_CA |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | * |
dc.subject | dynamic programming | ca_CA |
dc.subject | recursion schemes | ca_CA |
dc.subject | Haskell | ca_CA |
dc.subject | memoization | ca_CA |
dc.title | Easily Solving Dynamic Programming Problems in Haskell by Memoization of Hylomorphisms | ca_CA |
dc.type | info:eu-repo/semantics/article | ca_CA |
dc.identifier.doi | https://doi.org/10.1002/spe.2887 | |
dc.relation.projectID | RTI2018‐095 645‐B‐C22 | ca_CA |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca_CA |
dc.relation.publisherVersion | https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.2887 | ca_CA |
dc.type.version | info:eu-repo/semantics/submittedVersion | ca_CA |
Ficheros en el ítem
Este ítem aparece en la(s) siguiente(s) colección(ones)
-
INIT_Articles [754]
-
LSI_Articles [362]
Articles de publicacions periòdiques escrits per professors del Departament de Llenguatges i Sistemes Informàtics