Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Books Books 1 - 10 of about 45 related to An almost-optimal algorithm for the assembly line scheduling problem.   

An analysis of drum storage units

Stanford University. Computer Science Dept, Samuel H. Fuller, Forest Baskett - Computer storage devices - 1972 - 68 pages
The report discusses the modeling and analysis of drum-like storage units. Two common forms of drum organizations and two common scheduling disciplines are considered: the file ...
Snippet view - About this book

Interconnections for parallel memories to unscramble p-ordered vectors

Stanford University. Computer Science Dept, Roger C. Swanson - 1973 - 54 pages
Several methods are being considered for storing arrays in a parallel memory system so that various useful partitions of an array can be fetched from the memory with a single ...
Snippet view - About this book

Open, closed, and mixed networks of queues with different classes of customers

Stanford University. Computer Science Dept, Richard R. Muntz, Forest Baskett - Markov processes - 1972 - 42 pages
The authors derived the equilibrium distribution of states of a model containing four different types of service centers and R different classes of customers. From this steady ...
Snippet view - About this book

A modified working set paging algorithm

Stanford University. Computer Science Dept, Alan Jay Smith - 1974 - 43 pages
The working set paging algorithm is known to be highly efficient, yet has the disadvantage that during changes of locality large numbers of pages are accumulated in memory ...
Snippet view - About this book




  1. My library
  2. Help
  3. Advanced Book Search