Abstract: An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling ...

Accurate land use/land cover (LULC) classification remains a persistent challenge in rapidly urbanising regions especially, in the Global South, where cloud cover, seasonal variability, and limited ...

This repository contains comprehensive implementations of algorithms from the classic textbook "Fundamentals of Computer Algorithms" (Second Edition) by Ellis Horowitz, Sartaj Sahni, and Sanguthevar ...

The AoPA library allows one to encode Algebra of Programming (BdM97) style program derivation, both functional and relational, in Agda. Since the 90s, the program derivation community has been ...

Do greedy, shortest-delay, routing strategies make sense in a server farm, or is what's good for the individual disastrous for the system as a whole? How do high job size variability and heavy-tailed ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...