tyler/vimwiki
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update for 04-04-22 13:00

Browse Source
This commit is contained in:
Tyler Perkins 2022-04-04 13:00:02 -04:00
parent b2602a2fb7
commit de2a8ae1b9
2 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
tech/AI.wiki
View File

@ -5,11 +5,16 @@ AI or artifical intelligence is the art of making intelligent machines.
== Goals == == Goals ==
* Expert systems * Expert systems
* exhibit itlligent behaviours * exhibit itlligent behaviours in one field, (IE chess AIs beat humans)
* Human intelligence * Human intelligence
* behave, think, and learn like humans * behave, think, and learn like humans
== Types == == Types ==
* AI
* Machines which mimic human behaviour
* not even close as of currently
* [[machine_learning]] * [[machine_learning]]
* [[neural]] * Allow machines to find statistical relationships in data to mimic patterns
* Deep learning

6
tech/Dijkstra.wiki
View File

@ -5,7 +5,7 @@ for finding the *shortest path between any two nodes in a graph*. This can be
thought of finding the best route from point A to point B on something like a thought of finding the best route from point A to point B on something like a
road map. This is also called a *routing protocol*. road map. This is also called a *routing protocol*.
Dijkstra's Algorithm is a [[greedy_algorithm]]. Dijkstra's Algorithm is a [[greedy_algorithm]].
== Algorithm == == Algorithm ==
@ -20,9 +20,9 @@ Dijkstra's Algorithm is a [[greedy_algorithm]].
N1's distance is 6+2 = 8. If the node was previously marked as having a N1's distance is 6+2 = 8. If the node was previously marked as having a
different value, keep the smallest of the two values. different value, keep the smallest of the two values.
4) Once we have checked all of a nodes neighbors, remove it from the unvisited 4) Once we have checked all of a nodes neighbors, remove it from the unvisited
set. A visited node is never checked again. set. A visited node is never checked again.
5) If searching for a specific node, the algorithm can stop when the desired 5) If searching for a specific node, the algorithm can stop when the desired
node is no longer in the 'unvisted' set. node is no longer in the 'unvisted' set.
6) If not, select the unvisted node with the smalled distance, and set it as 6) If not, select the unvisted node with the smalled distance, and set it as
the current node, and go back to step 3 the current node, and go back to step 3