Günümüzde artan veri miktarıyla başa çıkabilmek için tek başına insan gücünün kullanılması mümkün görünmemektedir. Bu sebeple benzer dokümanları bir araya gruplayabilecek ya da dokümanları, önceden tanımlı kategorilere ...

Konvolüsyonel Sinir Ağları (KSA), katmanlarının en az bir tanesinde matris çarpımı yerine konvolüsyon işleminin kullanıldığı çok katmanlı yapay sinir ağlarının bir türüdür. Özellikle bilgisayarlı görü çalışmalarında çok ...

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 ...

Collateral mechanism in the Electricity Market ensures the payments are executed on a timely manner; thus maintains the continuous cash flow. In order to value collaterals, Takasbank, the authorized central settlement ...

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 ...

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 ...

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 ...

In this study, we model a CNN hyper-parameter optimization problem as a bi-criteria optimization problem, where the first objective being the classification accuracy and the second objective being the computational ...

The success of Convolutional Neural Networks is highly dependent on the selected architecture and the hyper-parameters. The need for the automatic design of the networks is especially important for complex architectures ...

A bi-criteria version of the curriculum-based university timetabling problem of ITC-2007 is solved using a multi-objective simulated annealing (MOSA) algorithm that identifies an approximation to the optimal Pareto front. ...