heuristics

The paper proposes SSLD, a method that improves the DSATUR heuristic for graph coloring by using semidefinite programming to preprocess an initial color class, demonstrating better performance on benchmark instances.

Paul Graham discusses heuristics for making startups more powerful, emphasizing transformations like network effects, app stores, and full-stack approaches to increase value.

This paper introduces Smart Routes, a platform for developing and comparing algorithms for vehicle routing problems with realistic constraints, showing that deep learning and heuristic methods can match exact solutions in quality with less time for larger problem sizes.

Red Blob Games releases an interactive tutorial page on differential heuristics, an optimization technique for A* pathfinding, after over a decade of development.

An interactive experiment by The Pudding analyzes 30,954 people's lawn-mowing paths, revealing how humans approximate optimal solutions to coverage path planning, a variant of the Traveling Salesman Problem.

A tutorial on improving A* pathfinding heuristics using landmark-based differential techniques to reduce node exploration, with interactive demos from game maps.

Scores update from the ongoing AtCoder heuristics finals, which will continue until July 8, 19:00 JST.

The article discusses heuristics for lab robotics, covering different types of robots (box vs. arm), the cost-benefit of automating protocols, and the future directions in translation, hardware, and intelligence layers. It draws on insights from multiple experts in the field.

SHAPE is a framework that analyzes chain-of-thought reasoning in large language models using semantic spaces and heuristics to diagnose and improve mathematical reasoning through post-training.

A survey of inlining heuristics in method JIT compilers, discussing the challenges of when to inline and the trade-offs involved, with examples from Ruby and Python.

This Twitter thread highlights Stanford CS221 lecture 6 on heuristics, explaining how A* search improves agent efficiency by using heuristics to guide decision-making. Key takeaways include building heuristics by relaxing problems, the danger of bad heuristics, and the optimality of A* with the right estimate.

LiteParse is an open-source, heuristic-based PDF parser that quickly converts complex layouts, text, and tables into a clean spatial grid without relying on ML models.