#### Filter Results:

#### Publication Year

2002

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

First year Computer Science students often encounter difficulties when learning to write procedural and object-oriented programs for the first time. This is also true of students being exposed to a new programming paradigm. One-on-one tutoring has proven to be the most effective means of assisting first time programmers overcome learning difficulties.… (More)

Hyper-heuristics are aimed at providing a generalized solution to optimization problems rather than producing the best result for one or more problem instances. This paper examines the use of evolutionary algorithm (EA) selection hyper-heuristics to solve the offline one-dimensional bin-packing problem. Two EA hyper-heuristics are evaluated. The first… (More)

Earlier research into the examination timetabling problem focused on applying different methodologies to generate solutions to the problem. More recently research has been directed at developing hyper-heuristic systems for timetable construction. Hyper-heuristic systems are used to decide which examination to schedule next during the timetable construction… (More)

Research in the domain of examination timetabling is moving towards developing methods that gener-alise well over a range of problems. This is achieved by implementing hyper-heuristic systems to find the best heuristic or heuristic combination to allocate examinations when constructing a timetable for a problem. Heuristic combinations usually take the form… (More)

This paper presents a genetic programming (GP) hyper-heuristic approach that optimizes a search space of functions to assess the difficulty of allocating an examination during the timetable construction process. Each function is a heuristic combination of low-level construction heuristics combined by logical operators. The approach is tested on a set of… (More)

There has been a large amount of research into the automatic generation of school timetables. Methodologies such as constraint programming, simulated annealing, Tabu search and genetic algorithms have been applied to the school timetabling problem. However, a majority of these studies focus on solving the problem for a particular school and there is very… (More)

Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second takes an indirect approach to the problem and examines the generation of heuristics or combinations of heuristics, i.e. hyper-heuristics, to be used in the construction of… (More)

Although there has been a fair amount of research in the area of school timetabling, this domain has not developed as well as other fields of educational timetabling such as university course and examination timetabling. This can possibly be attributed to the fact that the studies in this domain have generally been conducted in isolation of each other and… (More)

The high school timetabling problem differs drastically from one school to another and from country to country. The South African high school problem has not been researched. This paper presents a genetic algorithm (GA) to solve this problem for a particular high school. A two-phase approach is taken. The first phase uses a GA to evolve a timetable that… (More)

Novice programmers usually experience difficulties when programming for the first time. The main aim of the study presented in this paper is to identify those characteristics that negatively effect procedural programming performance, so that additional support can be provided in the instruction of programming courses for students possessing these… (More)