The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. Sp. Issue 1 / 2014  
         
  Article:   SOME IMPROVEMENTS OF THE EXTENDED BREADTH-FIRST SEARCH ALGORITHM.

Authors:  .
 
       
         
  Abstract:   Extended breadth- first search (EBFS) is an algorithm developed to give remedy to some problems related to the classical state-space representation used in arti ficial 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 Classi fication. 68T20.1998 CR Categories and Descriptors. I.2.8 [Computing Methodologies]: ARTIFICIAL INTELLIGENCE - Problem Solving, Control Methods, and Search.

Key words and phrases. arti ficial intelligence, state-space representation, extended model, breadth-fi rst search.
 
         
     
         
         
      Back to previous page