Open AccessThe 2008 Classic Paper Award: Summary and Significance
Author(s) -
Friedland Peter
Publication year - 2010
Publication title -
ai magazine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
DOI - 10.1609/aimag.v31i4.2309
Subject(s) - constraint satisfaction problem , usable , heuristic , constraint satisfaction , class (philosophy) , operations research , constraint (computer aided design) , computer science , scheduling (production processes) , artificial intelligence , engineering , operations management , world wide web , probabilistic logic , mechanical engineering
We at the NASA laboratory believed that our best work came when we simultaneously advanced AI theory and provided immediately usable solutions for current NASA problems. “Solving Large‐Scale Constraint Satisfaction and Scheduling Problems Using a Heuristic Repair Method,” by Steve Minton, Mark Johnston, Andy Phillips, and Phil Laird clearly achieved both. It proved that local search and repair was applicable to a wide class of constraint‐satisfaction problems and clearly explicated the theory behind that proof.