Busque entre los 161228 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-11-15T11:27:06Z | |
dc.date.available | 2012-11-15T11:27:06Z | |
dc.date.issued | 2006-08 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/24183 | |
dc.description.abstract | The paper analyses and compares alternative iterative and recursive implementations of N-ary search algorithms in hardware (in field programmable gate arrays, in particular). The improvements over the previous results have been achieved with the aid of the proposed novel methods for the fast implementation of hierarchical algorithms. The methods possess the following distinctive features: 1) providing sub-algorithms with multiple entry points; 2) fast stack unwinding for exits from recursive sub-algorithms; 3) hierarchical returns based on two alternative approaches; 4) rational use of embedded memory blocks for the design of a hierarchical finite state machine. | es |
dc.language | en | es |
dc.subject | Search process | es |
dc.subject | Heuristic methods | es |
dc.title | Recursive and iterative algorithms for N-ary search problems | en |
dc.type | Objeto de conferencia | es |
sedici.identifier.isbn | 0-387-34655-4 | es |
sedici.creator.person | Sklyarov, Valery | es |
sedici.creator.person | Skliarova, Iouliia | es |
sedici.description.note | Applications in Artificial Intelligence - Search | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2006-08 | |
sedici.relation.event | 19 th IFIP World Computer Congress - WCC 2006 | es |
sedici.description.peerReview | peer-review | es |