27 results on '"Coffman E"'
Search Results
2. Is Fallible Knowledge Attributable?
3. Moral Blameworthiness, Quality of Will, and Akratic Action
4. Direct Blameworthiness for Non-conduct?
5. How small are shifts required in optimal preemptive schedules?
6. Strategy vs risk in margining portfolios of options
7. Does knowledge secure warrant to assert?
8. Two claims about epistemic propriety
9. Warrant without truth?
10. Thinking about luck
11. Optimal seamless self-assembly of files in linear networks
12. Approximation Algorithms for Extensible Bin Packing
13. Ideal preemptive schedules on two processors
14. Bandwidth packing
15. Packing random intervals
16. Scheduling saves in fault-tolerant computations
17. Packings in two dimensions: Asymptotic average-case analysis of algorithms
18. Batch sizing and job sequencing on a single machine
19. A performance guarantee for the greedy set-partitioning algorithm
20. An efficient algorithm for allocating paged, drum-like storage
21. Bin packing: Maximizing the number of pieces packed
22. Algorithms minimizing mean flow time: schedule-length properties
23. Queueing models of secondary storage devices
24. Polling and greedy servers on a line
25. On file structuring for non-uniform access frequencies
26. Performance predictions for extended paged memories
27. Optimal scheduling for two-processor systems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.