/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 cp-algorithms.com
Hungarian Algorithm - Algorithms for Competitive Programming
| | jeremykun.com
The Reasonable Effectiveness of the Multiplicative Weights Update Algorithm Math Programming
4.7 parsecs away

Travel
| | Hard to believe Sanjeev Arora and his coauthors consider it"a basic tool [that should be] taught to all algorithms students together with divide-and-conquer, dynamic programming, and random sampling."Christos Papadimitriou calls it"so hard to believe that it has been discovered five times and forgotten." It has formed the basis of algorithms inmachine learning, optimization, game theory,
| | www.adamconrad.dev
Maximum Flow Algorithms for Networks in JavaScript - Adam C. Conrad
4.4 parsecs away

Travel
| | Follow along with Steven Skiena's Fall 2018 algorithm course applied to the JavaScript language.
| | opensourc.es
TSP: Greedy approach and using a 1-Tree
8.4 parsecs away

Travel
| | An introduction to the most simple TSP heuristic as well as a more sophisticated lower bound. More coming soon!
| | blog.fastforwardlabs.com
"Hello world" in Keras (or, Scikit-learn versus Keras)
27.5 parsecs away

Travel
| This article is available as a notebook on Github. Please refer to that notebook for a more detailed discussion and code fixes and updates. Despite all the recent excitement around deep learning, neural networks have a reputation among non-specialists as complicated to build and difficult to interpret. And while interpretability remains an issue, there are now high-level neural network libraries that enable developers to quickly build neural network models without worrying about the numerical details of floating point operations and linear algebra.