11 to 11 of 11 Results
Jun 27, 1993
Gratch, Jonathan; Chien, Steve; DeJong, Gerald, 1993, "Learning Search Control Knowledge for Deep Space Network Scheduling", https://hdl.handle.net/2014/35258, Amherst, MA, USA, JPL Open Repository
While the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, for specific distributions of problems and constraints, domain-specific solutions have been shown to perform in much better than exponential time. |