The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function.
Beate BolligPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- worst case
- random access
- piecewise linear
- optimal solution
- dynamic allocation
- dynamic programming
- storage management
- disk storage
- storage devices
- file system
- read write
- computational complexity
- secondary storage
- storage cost
- storage and retrieval
- single parameter
- optimality criterion
- error tolerance
- hard disk
- storage systems
- control policy
- neural network
- space complexity
- data storage
- operating system
- cloud computing
- access control
- simulated annealing
- query processing
- genetic algorithm