Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Collaborative proxy system for distributed Web content transcoding
Proceedings of the ninth international conference on Information and knowledge management
WebSplitter: a unified XML framework for multi-device collaborative Web browsing
CSCW '00 Proceedings of the 2000 ACM conference on Computer supported cooperative work
PTC: Proxies that Transcode and Cache in Heterogeneous Web Client Environments
WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
An Active Transcoding Proxy to Support Mobile Web Access
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Systematic Multiresolution and its Application to the World Wide Web
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Dynamic Programming
Adapting multimedia Internet content for universal access
IEEE Transactions on Multimedia
A personal Web page tailoring toolkit for mobile devices
Computer Standards & Interfaces
Hi-index | 0.00 |
This paper considers Web content adaptation with a bandwidth constraint for server-based adaptive Web systems. The problem can be stated as follows: Given a Web page P consisting of n component items d1, d2,..., dn and each of the component items di having Ji versions di1, di2,..., diji, for each component item di, select one of its versions to compose the Web page such that the fidelity function is maximized subject to the bandwidth constraint. We formulate this problem as a linear multi-choice knapsack problem (LMCKP). This paper transforms the LMCKP into a knapsack problem (KP) and then presents a dynamic programming method to solve the KP. A numerical example illustrates this method and shows its effectiveness.