| dc.creator | Sklyarov, Valery | |
| dc.creator | Skliarova, Iouliia | |
| dc.date | 2006-08 | |
| dc.date | 2006-08 | |
| dc.date | 2012-11-15T11:27:06Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/24183 | |
| dc.identifier | isbn:0-387-34655-4 | |
| dc.description | 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. | |
| dc.description | Applications in Artificial Intelligence - Search | |
| dc.description | Red de Universidades con Carreras en Informática (RedUNCI) | |
| dc.format | application/pdf | |
| dc.language | en | |
| dc.relation | 19 th IFIP World Computer Congress - WCC 2006 | |
| dc.rights | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
| dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
| dc.subject | Ciencias Informáticas | |
| dc.title | Recursive and iterative algorithms for N-ary search problems | |
| dc.type | Objeto de conferencia | |
| dc.type | Objeto de conferencia | |
