Abstract: University course timetabling is a NP-hard problem which is very difficult to solve by conventional methods. A highly constrained combinatorial problem, like the timetable, can be solved by ...
Abstract: Iterative gradient-based optimization algorithms are widely used to solve difficult or large-scale optimization problems. There are many algorithms to choose from, such as gradient descent ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results