/explore
|
You are here 
|
louisabraham.github.io | ||
| | | | |
bayesianneuron.com
[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. |
|
| | | | | ||
| | | | |
kevinkle.in
I modeled solving a Sudoku board as a constraint optimization problem. |
|
| | | | | ||
| | | | |
qsantos.fr
|
|
| | | | | ||
| | | | |
mathscholar.org
[AI summary] An article discusses the evolution of mathematics from a discipline that resisted computational tools to one that increasingly relies on computer-assisted proofs, data mining, and artificial intelligence, featuring perspectives from mathematician Terence Tao on the future of the field. |
|
| | | |||
