activity
20132021
most citedIncorporating Machine Learning to Evaluate Solutions to the University Course Timetabling Problem

7 citations · 14 across the 5 of their papers we have counts for

collaborators

5 papers

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.AI2020★ 1 cited

Meta-Heuristic Solutions to a Student Grouping Optimization Problem faced in Higher Education Institutions

Patrick Kenekayoro, Biralatei Fawei

Combinatorial problems which have been proven to be NP-hard are faced in Higher Education Institutions and researches have extensively investigated some of the well-known combinato…

cs.NE2016★ 1 cited

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…

cs.DL2013★ 4 cited

Motivation for hyperlink creation using inter-page relationships

Patrick Kenekayoro, Kevan Buckley, Mike Thelwall

Using raw hyperlink counts for webometrics research has been shown to be unreliable and researchers have looked for alternatives. One alternative is classifying hyperlinks in a web…