2020年1月6日月曜日
Best vegetarian multivitamin for IT professionals and CS students on a budget
Made in Canada, Webber Men's Most Complete Multi sold at Walmart regularly at 16.99 CAD on sale for 12.99 CAD right now.
The capsules have green powder in them, you get 90 capsules, take one per day, it just seems wayyy better for me than anything else available at that price point.
https://webbernaturals.com/en-ca/product/mens-most-complete-multi/
I swear to god that my coding skills in Python or any other language is way better on a vegetarian, vegan or no meat diet.
Meat just interferes with my chain of thought.
I finished search, basically maze solving, on AI for Robotics, Sebastien Thurn's course on Udacity and here's the .ipynb notebook:
https://github.com/nyck33/AI4RUdacity/blob/master/Lesson12Search.ipynb
I discovered a new usage in for loops where I decrement the counter in a DFS search where a particular branch leads to a dead end so it goes back to the previous level.
Next is A-star a heuristic algorithm that estimates the distance left to goal assuming there are no obstacles which helps in calculating an f = g +h where f is the term used to choose between nodes to expand, g is the distance travelled up to that point and h is the A-star estimate.
The capsules have green powder in them, you get 90 capsules, take one per day, it just seems wayyy better for me than anything else available at that price point.
https://webbernaturals.com/en-ca/product/mens-most-complete-multi/
I swear to god that my coding skills in Python or any other language is way better on a vegetarian, vegan or no meat diet.
Meat just interferes with my chain of thought.
I finished search, basically maze solving, on AI for Robotics, Sebastien Thurn's course on Udacity and here's the .ipynb notebook:
https://github.com/nyck33/AI4RUdacity/blob/master/Lesson12Search.ipynb
I discovered a new usage in for loops where I decrement the counter in a DFS search where a particular branch leads to a dead end so it goes back to the previous level.
Next is A-star a heuristic algorithm that estimates the distance left to goal assuming there are no obstacles which helps in calculating an f = g +h where f is the term used to choose between nodes to expand, g is the distance travelled up to that point and h is the A-star estimate.
登録:
投稿 (Atom)
-
Deep Q Networkを改善してCartpole-V1を140エピソードで攻略しました（最寄りのスコア10個の平均値が５００を達成した時点で終了）。 ソースコードは借りたものですが、Experience Replay用のBufferが十分に埋まるまでEpsilon値を削... -
https://www.economist.com/technology-quarterly/2015/03/05/silicon-valley-gets-a-taste-for-food
-
まずはRNNの復習を終わったところでRNN及びLSTMをDeep Reinforcement Learningで使えるかどうか調べたら、このようなリサーチペーパーがありました： DRQN？！ . They have, however, struggled with learn...