Abstract: Ant colony optimization (ACO) algorithms have been widely adopted in solving combinatorial problems, like the traveling salesman problem (TSP). Nevertheless, with a proper transformation to ...

Abstract: We describe a natural extension of the banker's algorithm (D.W. Dijkstra, 1968) for deadlock avoidance in operating systems. Representing the control flow of each process as a rooted tree of ...