Filter by

  • Publication Year
  • Availability
  • Attachment
  • Collection Type
    See More
  • General Material Designation
    See More
  • Location
    See More
  • Language
    See More
Found 2 from your keywords: subject="Pencarian rute"
cover
PENCARIAN RUTE TERDEKAT PADA PERMAINAN DENGAN HALANGAN DINAMIS MENGGUNAKAN ME…
Comment Share
Ihwan, M Munirul

Pathfinding in games presents a complex challenge, particularly when the game environment is dynamic and unpredictable. The D* Lite algorithm is an advanced solution that offers advantages in efficiently finding optimal paths in environments that frequently change. Unlike conventional pathfinding algorithms, D* Lite can quickly update previously computed paths when changes occur in the map, suc…

Edition
-
ISBN/ISSN
-
Collation
xiv, 58 hlm.; ilus.; 29 cm
Series Title
-
Call Number
T1567922024
cover
Perbandingan algoritma floyd warshall dan algoritma A dalam pencarian rute te…
Comment Share
Togi Martua Hutagalung

Persoalan pencarian rute terpendek adalah persoalan optimasi yang sering ditemui dalam kehidupan sehari-hari. Penyelesaian persoalan ini dapat diselesaikan secara baik dan efisien menggunakan algoritma tertentu. Pada penelitian ini dilakukan perbandingan waktu proses algoritma Floyd Warshall dan A* dalam menyelesaikan permasalahan pencarian rute terpendek menuju lokasi rumah sakit umum di …

Edition
-
ISBN/ISSN
-
Collation
xiv, V-1 hlm. : ilus.
Series Title
-
Call Number
004.610 7 Hut p 2016