Abstract: The simplex method, as proposed by Dantzig in 1947, is a widely-used practical algorithm for solving Linear Programs (LPs)—systems of linear inequalities headed by a single linear objective ...

Abstract: The minimum-time regulator problem is solved computationally for general linear-discrete systems by a modification of the simplex algorithm of linear programming (LP). The algorithm ...

Complete course notes from COMP 458: Quantum Computing Algorithms (Spring 25). The latest version of these notes is available at micahkepe.com/comp458-notes. This ...

State-of-the-art techniques for pavement performance evaluation have attracted considerable attention in recent years. Artificial Neural Networks (ANNs) can simulate the human brain to discover hidden ...

Genetic code; the pattern search problem and naïve pattern search; improving upon the naïve method and the Rabin Karp algorithm Linear data analysis; logistic map, fractal dimension, and correlation ...