A Linear Multi-Choice Knapsack Problem with Application in Web Content Adaptation

• Main Authors: Ching-Peng Lin, 林清鵬
• Other Authors: Rong-Hong Jan
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/10978480016350511405

碩士 === 國立交通大學 === 資訊科學系 === 90 === In the recent year, Internet becomes very popular and everyone needs it to get the global information from the WWW. WWW client devices vary from low capacity wireless PDA to high performance desktop PC and networks rang from low speed modem links to high speed ATM backbones. This heterogeneity makes user to know the network constraints of different users. Composite Capabilities and Preference Profiles (CC/PP), proposed by W3C recently, is a standard of describing user agent’s capabilities and preferences, and in our early work, we designed a web content adaptation system, which can detect bandwidth dynamically and adapt various capabilities and preferences of clients based on CC/PP. In this thesis, we formulate the web content selection problem as a linear multi-choice knapsack problem (LMCKP). A dynamic programming is proposed to solve it. Then, the optimal solution of LMCKP is used to reduce the processing time of adaptive web server.