A Reinforced Evolution-Based Approach to Multi-Resource Load Balancing
A fundamental goal in computer science is to provide an algorithm which would determine an optimal solution in acceptable time. Computational Complexity Theory is the field which studies the efficiency of computation; its major goals are to find efficient algorithms for natural problems or to show that no efficient solutions exist. NP-hard (Nondeterministic Polynomial-time hard), represents a class of problems which are 'at least as difficult as problems in NP'. NP-complete problems can be solved by means of exhaustive search. However the time to wait for the solution grows unacceptably with the problem size as the number of iterations needed to solve the problem becomes tremendous. In such a case the best the authors can hope for are super-polynomial time algorithms.