/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

 opensourc.es
Constraint Solver Part 6: Backtrack and Sum constraint
| | kevinkle.in
Sudoku #2: Linear Programming - Blog
6.6 parsecs away

Travel
| | I modeled solving a Sudoku board as a constraint optimization problem.
| | bayesianneuron.com
0/1 Knapsack Discrete Optimization w/ Dynamic Programming - Bayesian Neuron
7.0 parsecs away

Travel
| | [AI summary] The user has shared a detailed exploration of optimizing the 0/1 Knapsack problem using dynamic programming with Python and NumPy. They discuss various optimization techniques, including reducing memory usage with a 2-row approach, vectorization using NumPy's `np.where` for faster computation, and the performance improvements achieved. The final implementation shows significant speedups, especially for large-scale problems, and the user highlights the importance of vectorization and efficient memory management in computational tasks.
| | mishadoff.com
DFS on Binary Tree Array
9.0 parsecs away

Travel
| |
| | herbertograca.com
Dev curricula - @hgraca
35.4 parsecs away

Travel
| This is a listing of articles about concepts I find essential for any developer to know. This is organized in order of most base structural concepts to most high level concepts and includes good practices, principles, and lists of articles, conference talks and books on software development. This page is in constant enhancement. Good Practices...