Ara
Toplam kayıt 6, listelenen: 1-6
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 ...
Neural Architecture Search Using Metaheuristics for Automated Cell Segmentation
(Springer, 2023)
Deep neural networks give successful results for segmentation of medical images. The need for optimizing many hyper-parameters
presents itself as a significant limitation hampering the effectiveness of
deep neural network ...
Triplet MAML for Few-shot Classification Problems
(Springer, 2023)
In this study, we propose a TripletMAML algorithm as an extension to Model-Agnostic Meta-Learning (MAML) which is the most widely-used optimization-based meta-learning algorithm. We approach MAML from a metric-learning ...
Evolutionary Architecture Optimization for Retinal Vessel Segmentation
(IEEE, 2023)
Retinal vessel segmentation (RVS) is crucial
in medical image analysis as it helps identify and monitor
retinal diseases. Deep learning approaches have shown
promising results for RVS, but designing optimal neural
network ...