Ara
Toplam kayıt 9, listelenen: 1-9
Integer Programming Versus Constraint Programming: a Course Timetabling Case Study
(University of Cincinnati Industrial Engineering, 2019)
In this study, two solution approaches are compared for a real-world, moderate-size but a highly constrained university
course timetabling problem. The first approach is developing an integer programming model and solving ...
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 ...
Robust University Course Timetabling Problem Subject to Single and Multiple Disruptions
(Elsevier, 2020)
University course timetables are often finalized in stages, in between which, changes in the data make the earlier version infeasible. As each version is announced to the community, it is desirable to have a robust initial ...
A Bi-criteria Hybrid Genetic Algorithm with Robustness Objective for the Course Timetabling Problem
(Elsevier, 2018)
Traditional methods of generating timetables may yield high-quality solutions, but they may not yield robust solutions that may easily be adapted to changing inputs. Incorporating late changes by making minimum modifications ...
A Bi-criteria Hybrid Genetic Algorithm with Robustness Objective for the Course Timetabling Problem
(Patat, 2016)
Traditional methods of generating timetables may not yield robust solutions
that may easily be adapted to changing inputs. Incorporating late changes
by making minimum modifications is an important need in many ...
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 ...
A Comparison of Different Loss Computations in Siamese Networks for Authorship Verification
(Springer, 2023)
In this study, we consider the author verification problem as a binary
classification problem where the aim is to identify whether the two inputs belong to
the same author or not. For this task, we have used several ...
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 ...