Istituto di Scienza e Tecnologie dell'Informazione     
Martelli A., Montanari U. An application of heuristically guided search to elimination processes. Internal note IEI-B71-20, 1971.
Heuristically guided search is a method developed in artificial intelligence by Hart, Nilsson and Raphael for using heuristic information from the problem domain to direct the search. The algorithm is assured to find an optimal solution by searching the minimum possible amount of space. In the paper, this technique is used for finding the optimal ordering of variables in an elimination process. If the “ interaction graph” describing the problem is approximately of the triangulated type, the saving in search over the “blind” approach can be considerable. Approximate methods can also be developed using problem solving concepts. In particular, the results of this paper apply to non-serial dynamic programming and Gaussian elimination.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional