The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
The GridBASE framework for database-driven grid computing is presented. The design and a prototype implementation of the framework is discussed. Industry-strength database technol...
Grid computing is becoming an important framework for enabling applications to utilize widely distributed collections of computational and data resources, however current grid sof...
Paul D. Coddington, Lici Lu, Darren Webb, Andrew L...
In 2002, Harvard University's Division of Continuing Education (DCE) expanded its computer lab facility. This expansion allowed DCE to change its previous policy of restricti...
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...