NASA NTRS · 20060038933
Learning Search Control Knowledge for Deep Space Network Scheduling
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gratch, Jonathan, Chien, Steve, DeJong, Gerald. 1993-06-27. Learning Search Control Knowledge for Deep Space Network Scheduling. https://ntrs.nasa.gov/citations/20060038933
Cite the original work for its findings. Save a collection to share your selection of sources.