Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
KI
/
Paper
Forward Chaining Algorithm for Solving the Shortest Path Problem in Arbitrary Deterministic Environment in Linear Time - Applied for the Tower of Hanoi Problem.
Silvana Petruseva
Venue
National
KI
Year
2009
Proceedings
KI
DBLP record
conf/ki/Petruseva09 ↗
Browse the full
KI paper archive
.