Category: computer science
Computer science fundamentals covering algorithms, theory, and research from a Singapore Institute of Technology perspective.
-
Solving the Traveling Salesman Problem: Nearest Neighbor, 2-Opt, 3-Opt and Tabu Search
Learn how nearest neighbor builds a Traveling Salesman tour, how 2-opt and 3-opt improve it, and how tabu search escapes…
-
Optimization Problems Explained: Traveling Salesman, Job Shop Scheduling, and the Knight’s Tour
What the Traveling Salesman Problem, Job Shop Scheduling, and the Knight’s Tour have in common — combinatorial explosion, NP-hardness, and…
-
The Computer-Science Bubble Is Bursting – The Atlantic
Artificial intelligence is ideally suited to replacing the very type of person who built it. https://www.theatlantic.com/economy/archive/2025/06/computer-science-bubble-ai/683242
-
Computer Scientists Establish the Best Way to Traverse a Graph
Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now…
-
How to Build an Origami Computer | Quanta Magazine
https://www.quantamagazine.org/how-to-build-an-origami-computer-20240130/
-
AI poisoning tool Nightshade received 250,000 downloads in 5 days | VentureBeat
https://venturebeat.com/ai/ai-poisoning-tool-nightshade-received-250000-downloads-in-5-days-beyond-anything-we-imagined/
