2 Matching Annotations
- Oct 2020
-
reisub0.github.io reisub0.github.io
-
Most people seem to follow one of two strategies - and these strategies come under the umbrella of tree-traversal algorithms in computer science.
Deciding whether you want to go deep into one topic, or explore more topics, can be seen as a choice between two types of tree-traversal algorithms: depth-first and breadth-first.
This also reminds me of the Explore-Exploit problem in machine learning, which I believe is related to the Multi-Armed Bandit Problem.
-
- Dec 2019
-
survivejs.com survivejs.com
-
Don't let the complexity get to you. Don't let the vast breadth of content get to you.
-