Now showing items 49-51 of 486

    • Complexity Results for Single Machine Distance Constrained Scheduling Problems 

      Engels, Daniel W.; Karger, David; Devadas, Srinivas (1998-11)
      Scheduling problems that involve timing constraints between tasks occur often in machine shop scheduling (e.g., job shop scheduling problems) and code scheduling during software compilation for pipelined processors (e.g., ...
    • Extracting all the Randomness from a Weakly Random Source 

      Vadhan, Salil (1998-08)
      In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The first extracts any constant fraction of the min-entropy using O(log^2 n) ...
    • Local Rules Modeling of Nucleation-Limited Virus Capsid Assembly 

      Schwartz, Russell; Prevelige, Peter E.; Berger, Bonnie (1998-08)
      We describe an application of computer modeling to the study of the kinetics of virus capsid (protein shell) assembly. We examine two proposed models of the source of nucleation-limited growth, an observed growth pattern ...