Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...

LONDON—When academic David Cliff—formerly of Hewlett-Packard (HP) and Deutsche Bank, who now heads his own technology company, Syritta, based in south England—says that the next generation of ...

We derive several algorithms for the busy period distribution of the canonical Markovian fluid flow model. One of them is similar to the Latouche-Ramaswami algorithm for quasi-birth-death models and ...

Using a design flow put together by Mentor Graphics and Altera, designers can implement complex DSP algorithms in high-performance FPGAs directly from ANSI C++ code. The flow, which is based on Altera ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...