Graph-based A* beats basic branch-and-bound on project scheduling
With extra pruning, A* proves optimality on all 480 RCPSP instances, versus 445 for best-first branch-and-bound.
11 stories, newest first · one card per story
With extra pruning, A* proves optimality on all 480 RCPSP instances, versus 445 for best-first branch-and-bound.
Bilinear filter updates policy competence instantly while stabilizing item intercepts.
On Qwen3-8B it scores 48.81 after 40 steps, above random selection's best score after 120 steps.
Verified merging keeps a 1 over fractional-chromatic-number share of local gains and cuts route wall time 15%.
Statement-level reordering certifies peak-memory-optimal inference schedules more reliably than regenerating compiler code.
AllenAI published a blog on scheduling work across shared GPU clusters.
MAPPO agents schedule TSN queues in vehicular edge networks, cutting latency versus centralized baselines.
A confusion-matrix robustness framework yields optimal non-adaptive scheduling when job times are unknown until completion.
High-bandwidth flash cuts LLM serving completion time by 36-87% when scheduling preserves flash write lifetime.
A reward-free, fly-inspired scheduler reduced duplicate actions in lab autonomous penetration tests without finding more vulnerabilities.
Researchers present JANUS, a botnet-driven attack that manipulates beam-hopping schedulers in LEO satellite networks, denying service to up to 95% of victims.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views