Abstract: This study proposes an automated quantitative content analysis algorithm, implemented in Python, to optimize the item generation process of adolescent stressor measurement tools and to ...

With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).

Abstract: This paper investigates the capacitated power cover problem with submodular penalties (CPCSP), which aims to minimize total power cost and penalty costs while respecting capacity constraints ...