A discrete-time distributed algorithm to solve a system of linear equations Ax = b is proposed with M-Fejer mappings. The algorithm can find a solution of Ax = b from arbitrary initializations at a ...

Multi-objective integer non-linear programming (MINP) problems are ubiquitous in real life, however, only the ε-constraint method can be used to solve MINP problems. To improve the computation time of ...

Mastering Fundamental Algorithms Algorithms are just step-by-step instructions for solving a problem. Some common ones you’ll see a lot are sorting algorithms (like bubble sort, merge sort, and ...