|
You are here |
fredrikj.net | ||
| | | | |
randorithms.com
|
|
| | | | | The Taylor series is a widely-used method to approximate a function, with many applications. Given a function \(y = f(x)\), we can express \(f(x)\) in terms ... | |
| | | | |
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. | |
| | | | |
www.bearssl.org
|
|
| | | | | ||
| | | | |
blog.ifem.co.uk
|
|
| | | This is a joint blog post by me and Jasmina Lazic, my co-presenter at #mathsconf6 (see my write up of the day) on Saturday 5th March 2016. Me and Jasmina first interacted over twitter, and over tim... | ||