Category: algorithms
Explore practical explanations of algorithms and computational problem-solving, from graph traversal and the Knight’s Tour to routing heuristics and combinatorial optimization.
Start here:
Optimization Problems Explained: Traveling Salesman, Job Shop Scheduling, and the Knight’s Tour — compare three combinatorial optimization problems and the heuristics used to tackle them.
Solving the Traveling Salesman Problem: Nearest Neighbor, 2-Opt, 3-Opt and Tabu Search — follow a practical progression from building a tour to improving it and escaping local optima.
Vibe Coding the Knight’s Tour with OpenAI Codex CLI — see a heuristic implemented and tested in a small coding project.
Browse by date
| M | T | W | T | F | S | S |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
| 30 | ||||||
-
How to run Llama 2 and Code Llama on your laptop without GPU?
https://blog.gopenai.com/how-to-run-llama-2-and-code-llama-on-your-laptop-without-gpu-3ab68dd15d4a
-
Global Times: China introduces largest quantum cloud computing platform, moves industry to practical stage
https://www.globaltimes.cn/page/202308/1296632.shtml
-
New Scientist: DeepMind AI’s new way to sort objects could speed up global computing
https://www.newscientist.com/article/2376512-deepmind-ais-new-way-to-sort-objects-could-speed-up-global-computing/
-
Top Computer Science Discoveries: Quanta Magazine Review
Yes, 2022 saw breakthrough discoveries in computing. Missing post-quantum & complexity advances leaves blind spots. Read the Quanta CS breakthrough…
-
Kadane’s Algorithm — (Dynamic Programming) — How and Why does it Work? | by Rohit Singhal | Medium
https://medium.com/@rsinghal757/kadanes-algorithm-dynamic-programming-how-and-why-does-it-work-3fd8849ed73d