BitEA: BitVertex Evolutionary Algorithm to Enhance Performance for Register Allocation

GS Terci, E Abdulhalik, AA Bayrakci, B Boz - IEEE Access, 2024 - ieeexplore.ieee.org
Register allocation is important in compiler design to enhance the execution time of
programs, as CPU registers operate significantly faster than memory locations. The …

[PDF][PDF] Efficiently Computing Maximum Clique of Sparse Graphs with Many-Core Graphical Processing Units

L Cardone, S Di Martino, S Quer - ICSOFT 2024: 19th International …, 2024 - scitepress.org
The Maximum Clique is a fundamental problem in graph theory and has numerous
applications in various domains. The problem is known to be NP-hard, and even the most …