We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applic...
While iterative optimization has become a popular compiler optimization approach, it is based on a premise which has never been truly evaluated: that it is possible to learn the b...
Yang Chen, Yuanjie Huang, Lieven Eeckhout, Grigori...
: This paper describes a new methodology for using genetic programming to solve the missile countermeasures optimization problem. The resulting system evolves programs that combine...
A Datalog program can be translated into a system of fixpoint equations of relational algebra; this paper studies how such a system can be solved and optimized for a particular qu...