4 ms·
I studied if for my university dissertation. It's easy to think of practical applications, example - I have a folder of videos/mp3s etc and I want to fit them
by hackerboos 14y ago
I studied if for my university dissertation.
It's easy to think of practical applications, example - I have a folder of videos/mp3s etc and I want to fit them on a few DVD-Rs. This algorithm can calculate the most efficient way of getting the most data on the disk without splitting files.
- praptak 14y agoFun fact: some CD players could optimize the CD->audio cassette packing.
- ambrop7 14y agoI think that this would be an instance of the bin packing problem, not the knapsack problem ( http://en.wikipedia.org/wiki/Bin_packing_problem http://en.wikipedia.org/wiki/Bin_packing_problem ). (yes, the knapsack problem wikipedia page lists the bin packing problem as a generalization)
- adamgray 14y agoMe too! I compared general purpose GPU libraries versus performance on a Beowulf cluster and OpenMP / UPC. Was a lot of fun and an interesting experience.