This paper describes the Criss-Cross Method of solving linear programming problems. The method, a primal-dual scheme, normally begins with a problem solution that is neither primal nor dual feasible, ...

The transportation method of linear programming is extended to a more general class of problem, for which the "stepping-stone method" of Charnes and Cooper fails. The method is applicable to various ...

Formal methods offer a mathematically rigorous framework for the specification, development and verification of programming languages and software systems. By leveraging techniques such as theorem ...

An introduction to the programming principles, methods and techniques of computer graphics. The course covers general graphics methods and techniques, graphics transformations, drawing algorithms, 3D ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

Algorithms are one of the four cornerstones of Computer Science. An algorithm is a plan, a set of step-by-step instructions to solve a problem. If you can tie shoelaces, make a cup of tea, get dressed ...

Expert computer programmers show higher proficiency in certain behavioral and attention skills than their novice peers. To identify the responsible brain regions, scientists used fMRI to analyze the ...