LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 337-339 of 486
-
A Manager for Named, Permanent Objects
(1980-04)Storing data in a computing system for a long time has been of interest ever since it was possible to do so. Classically, on stores bit- or byte- strings, or perhaps arrays of "records." Yet, current programming philosophy ... -
Critical Path Scheduling of Task Systems with Resource and Processor Constraints
(1980-03)Several papers over the past few years have investigated minimum execution time scheduling of unit execution time (UET) task systems with resources. Because such scheduling problems are, in general, NP-hard, a variety of ... -
On the Computational Complexity of Cardinality Constraints in Relational Databases
(1980-03)We show that the problem of determining whether of not a lossless join property holds for a database, in the presence of key dependencies and cardinality constraints on the domains of the attributes is NP-complete.
