Tag
The article explores the optimal ApplicativeDo scheduling problem in GHC, which is disabled by default due to slowness, and draws an analogy to the dynamic programming algorithm used for RNA folding to improve compiler performance.
A Twitter thread uses a Google coding interview example to highlight the high compensation at Google and then pivots to how AI agents like Claude Skills can replace entire dev teams, changing the job market.
This paper presents a hybrid approach combining dynamic programming and constraint programming to solve the Partial Shop Scheduling Problem, demonstrating the viability of integrating both paradigms despite not outperforming pure CP solvers.
This paper proposes a unified knowledge-embedded reinforcement learning framework for generalized capacitated vehicle routing problems, combining route-first cluster-second heuristics with dynamic programming to achieve superior solution quality and strong generalization across diverse variants.