Heuristic search algorithms on directed trees

Petr Lisoněk

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica (1988)

  • Volume: 27, Issue: 1, page 347-354
  • ISSN: 0231-9721

How to cite

top

Lisoněk, Petr. "Heuristic search algorithms on directed trees." Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica 27.1 (1988): 347-354. <http://eudml.org/doc/23483>.

@article{Lisoněk1988,
author = {Lisoněk, Petr},
journal = {Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica},
keywords = {minimal-cost path; heuristic search},
language = {eng},
number = {1},
pages = {347-354},
publisher = {Palacký University Olomouc},
title = {Heuristic search algorithms on directed trees},
url = {http://eudml.org/doc/23483},
volume = {27},
year = {1988},
}

TY - JOUR
AU - Lisoněk, Petr
TI - Heuristic search algorithms on directed trees
JO - Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
PY - 1988
PB - Palacký University Olomouc
VL - 27
IS - 1
SP - 347
EP - 354
LA - eng
KW - minimal-cost path; heuristic search
UR - http://eudml.org/doc/23483
ER -

References

top
  1. Martelli A., On the complexity of admissible search algorithms, Artificial Intelligence, 8 (1977), 1-13. (1977) Zbl0344.68023MR0449013
  2. Merö L., A heuristic search algorithm with modifiable estimate, Artificial Intelligence, 23 (1984), 13-27. (1984) MR0760320
  3. Merö L., On admissible heuristic search algorithms, Počítače a umelá inteligencia, 1 (1982), 395-408. (1982) Zbl0511.68042
  4. Nilsson N. J., Principles of artificial intelligence, Palo Alto, Tioga Publishing Company 1980. In Russian, Moskva, Radio i svjaz 1985. (1980) Zbl0422.68039MR0791917

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.