We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
This paper studies the archival problem: how a digital library can preserve electronic documents over long periods of time. We analyze how an archival repository can fail and we p...
An Archival Repository reliably stores digital objects for long periods of time (decades or centuries). The archival nature of the system requires new techniques for storing, inde...
Brian F. Cooper, Arturo Crespo, Hector Garcia-Moli...
Abstract. Traditional news media report a single set of articles on current news stories. Online news sources make multiple stories on the same topic available re ecting di erent p...
Gareth J. F. Jones, David J. Quested, Katherine E....
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...