Abstract: The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable rooms. The ...

Abstract: Searching for the optimum tap-length that best balances the complexity and steady-state performance of an adaptive filter has attracted attention recently. Among existing algorithms that can ...

The dsa-ou organisation aggregates repositories related to M269, the algorithms and data structures course of the Open University in the UK. While the repositories mainly provide tools for M269 ...

The course introduces basic data structures and algorithmic techniques that allow students to solve computational problems on the most important data types, such as sequences, sets, trees, and graphs.