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 ...
Perplexity's Search as Code lets AI agents generate Python search workflows, but claimed token savings and benchmark gains ...
This python package implements k-medoids clustering with PAM and variants of clustering by direct optimization of the (Medoid) Silhouette. It can be used with arbitrary dissimilarites, as it requires ...
This repository consists of the implementation of some multi-agent path-planning algorithms in Python. The following algorithms are currently implemented: ...