Ara
Toplam kayıt 4, listelenen: 1-4
Minimum Penalty Perturbation Heuristics for Curriculum-Based Timetables Subject to Multiple Disruptions
(Elsevier, 2021)
Course timetables are often rendered infeasible due to unexpected changes in requirements and must be
repaired. Given an initial timetable, planners prefer a repaired timetable whose quality is worsened as little as
possible ...
Search Space Sampling by Simulated Annealing for Identifying Robust Solutions in Course Timetabling
(Institute of Electrical and Electronics Engineers Inc., 2020)
For many combinatorial optimization problems, it
is important to identify solutions that can be repaired without
degrading solution quality in case changes in the data associated
with the constraints make the initial ...
Bi-criteria Simulated Annealing for the Curriculum-based Course Timetabling Problem With Robustness Approximation
(Springer, 2022)
In the process of developing a university’s weekly course timetable, changes in the data, such as the available time periods
of professors or rooms, render the timetable infeasible, requiring the administrators to repair ...
Novel Surrogate Measures Based on a Similarity Network for Neural Architecture Search
(IEEE, 2023)
We propose two novel surrogate measures to predict the validation accuracy of the classification
produced by a given neural architecture, thus eliminating the need to train it, in order to speed up neural
architecture ...