A teenage programmer tests a set of instructions she has written to get her computer to mop the floor. Suitable for teaching at KS3, KS4 and National 4 and 5.

An algorithm for the determination of the economic design of X̄-charts based on Duncan's model is described in this paper. This algorithm consists of solving an implicit equation in design variables n ...

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...

Finding the most efficient way to transport items across a network like the U.S. highway system or the Internet is a problem that has taxed mathematicians and computer scientists for decades. To ...