We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
The misalignment of information systems (IS) components with the rest of an organization remains a critical and chronic unsolved problem in today's complex and turbulent worl...
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
While complex systems have been studied now for more than two decades, there still is no agreement on what complexity actually is. This lack of a definition might be a problem when...
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...