Now showing items 1-3 of 3
OPTIMASI RUTE TRAVELLING SALESMAN PROBLEM DENGAN ALGORITMA A* (A-STAR) (Travelling Salesman Problem Route Optimization With A* (A-Star) Algorithm)
Traveling Salesman Problem (TSP) is generally described as a case of a sales trip that depart from the city of origin to visit every city exactly once and return to the city of origin. One algorithm that can be used to ...
PENGENALAN SIDIK JARI MENGGUNAKAN GRAF TERHUBUNG 24 (Fingerprint Recognation Using Connected Graph
Someone could be known from his fingerprints because finger print is unique or not the same for everyone. Seen as a characteristic finger print pattern off low lines and the orientation of the flow lines on the skin. ...
APLIKASI JARINGAN HOPFIELD PADA TRAVELLING SALESMAN PROBLEM (TSP) (Application Hopfield Neural Network Of Travelling Salesman Problem)
Traveling Salesman Problem (TSP) is the travel problem a salesman who must visit n the point where a salesman must visit every dot exactly once and must eventually be returned to the starting point. In addition salesman ...