AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN
|
|||||||
Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului. |
|||||||
STUDIA INFORMATICA - Ediţia nr.Sp. Issue 1 din 2014 | |||||||
Articol: |
SOME IMPROVEMENTS OF THE EXTENDED BREADTH-FIRST SEARCH ALGORITHM. Autori: . |
||||||
Rezumat:
Extended breadth-first search (EBFS) is an algorithm developed to give remedy to some problems related to the classical state-space representation used in artificial intelligence. This algorithm was initially intended to give us the ability to handle huge state spaces. The authors have shown a number of examples of the practical use of EBFS since it was developed. Based on their experiences, they found some ways for improving the algorithm. This paper presents the new algorithm, which contains these improvements. 2010 Mathematics Subject Classification. 68T20.1998 CR Categories and Descriptors. I.2.8 [Computing Methodologies]: ARTIFICIAL INTELLIGENCE - Problem Solving, Control Methods, and Search. Key words and phrases. artificial intelligence, state-space representation, extended model, breadth-first search.
|
|||||||