The optimal read-once branching program complexity for the direct storage access function.
Beate BolligPublished in: Inf. Process. Lett. (2008)
Keyphrases
- worst case
- random access
- storage management
- piecewise linear
- closed form
- semi infinite programming
- dynamic allocation
- storage devices
- data storage
- secondary storage
- access control
- dynamic programming
- computational complexity
- data structure
- genetic algorithm
- neural network
- file system
- database
- space complexity
- storage and retrieval
- np hard
- control policy
- optimal solution
- data grid
- disk storage