摘要：We consider the problem of displaying commer- cial advertisements on web pages, in the ＂cost per click＂ model. The advertisement server has to learn the appeal of each type of visitor for the different advertisements in order to maximize the profit. Advertisements have constraints such as a certain number of clicks to draw, as well as a lifetime. This problem is thus inherently dynamic, and intimately com- bines combinatorial and statistical issues. To set the stage, it is also noteworthy that we deal with very rare events of in- terest, since the base probability of one click is in the or- der of 10-4. Different approaches may be thought of, rang- ing from computationally demanding ones （use of Markov decision processes, or stochastic programming） to very fast ones. We introduce NOSEED, an adaptive policy learning al- gorithm based on a combination of linear programming and multi-arm bandits. We also propose a way to evaluate the extent to which we have to handle the constraints （which is directly related to the computation cost）. We investigate the performance of our system through simulations on a realistic model designed with an important commercial web actor.

摘要：近年来,超三代移动通信系统的QoS体系结构已成为计算机网络领域和通信领域的一个研究热点.调研了相关的主要研究项目,通过对重点项目和国外该领域相关论文成果进行分析和比较,总结出未来B3G(beyond 3rdgeneration)系统QoS体系结构应是一种全IP的、层次化的、端到端的QoS体系结构,它应具有集成性、可管理性、可扩展性、自适应性和动态资源管理等特点.最后提出了B3G系统QoS体系结构的基本设计原则,并对未来工作进行了展望.