One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...

In a recent work [6], Borwein and Borwein derived a class of algorithms based on the theory of elliptic integrals that yield very rapidly convergent approximations to elementary constants. The author ...

This is a preview. Log in through your library . Abstract We describe a simplification of a recent polynomial-time algorithm of A. I. Barvinok for counting the number of lattice points in a polyhedron ...

In a world run by computers, there is one algorithm that stands above all the rest. It powers search engines, encrypts your data, guides rockets, runs simulations, and makes the modern digital ...

Cathy O’Neil believes there is a dark side to numbers. A mathematician by training, she earned her doctorate at Harvard and went on to become a tenure-track professor at Barnard College. In 2007, ...

Alan Richard Champneys is on the scientific board of the Smith Institute for Industrial Mathematics and Systems Engineering, receives funding from the UK Engineering and Physical Sciences Research ...