/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

 louisabraham.github.io
Solving Probabilistic Tic-Tac-Toe
| | kevinkle.in
Sudoku #2: Linear Programming - Blog
4.1 parsecs away

Travel
| | I modeled solving a Sudoku board as a constraint optimization problem.
| | qsantos.fr
Dynamic Programming is not Black Magic | Quentin Santos
3.1 parsecs away

Travel
| |
| | bayesianneuron.com
0/1 Knapsack Discrete Optimization w/ Dynamic Programming - Bayesian Neuron
4.3 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.
| | jamie-wong.com
Bending the Dynamic vs Static Language Tradeoff
23.6 parsecs away

Travel
| [AI summary] The post analyzes the tradeoffs between dynamically and statically typed programming languages regarding iteration speed, correctness, and IDE support, discussing how modern languages and techniques are attempting to combine the best aspects of both approaches.