7 citations · 9 across the 3 of their papers we have counts for
Showing cs.NEShow all
3 papers · 1 filter
cs.NE2021★ 1 cited
A Meta-Heuristic Search Algorithm based on Infrasonic Mating Displays in Peafowls
Patrick Kenekayoro
Meta-heuristic techniques are important as they are used to find solutions to computationally intractable problems. Simplistic methods such as exhaustive search become computationa…
cs.NE2020★ 7 cited
Incorporating Machine Learning to Evaluate Solutions to the University Course Timetabling Problem
Patrick Kenekayoro
Evaluating solutions to optimization problems is arguably the most important step for heuristic algorithms, as it is used to guide the algorithms towards the optimal solution in th…
cs.NE2016
Greedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem
Patrick Kenekayoro, Godswill Zipamone
Timetabling is a problem faced in all higher education institutions. The International Timetabling Competition (ITC) has published a dataset that can be used to test the quality of…