標題: An optimization model for Web content adaptation
作者: Jan, RH
Lin, CP
Chern, MS
資訊工程學系
Department of Computer Science
關鍵字: content transcoding;knapsack problem;dynamic programming
公開日期: 15-五月-2006
摘要: 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 d(1), d(2),...,d(n) and each of the component items d(i) having J(i) versions d(i1), d(i2),... d(ut), for each component item d(i) 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. (c) 2005 Elsevier B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/j.comnet.2005.06.006
http://hdl.handle.net/11536/12245
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2005.06.006
期刊: COMPUTER NETWORKS
Volume: 50
Issue: 7
起始頁: 953
結束頁: 965
顯示於類別:期刊論文


文件中的檔案:

  1. 000236786000005.pdf