On-Demand Chaotic Neural Network for Broadcast Scheduling Problem

Author(s):  
Kushan Ahmadian ◽  
Marina Gavrilova
2012 ◽  
Vol 151 ◽  
pp. 527-531
Author(s):  
Ming Sun ◽  
Yuan Guo ◽  
Xue Feng Dai ◽  
Yao Qun Xu

Compared with the noisy chaotic neural network, hysteretic noisy chaotic neural network always exhibits better optimization performance at higher noise levels, but exhibits worse optimization performance at lower noise levels. In order to enable the hysteretic noisy chaotic neural network to behave more excellent optimization performance not only at higher noise levels but also at lower noise levels, we introduce a noise compensation factor to the original hysteretic noisy chaotic neural network, and present noise compensation based hysteretic noisy chaotic neural network. The proposed network can outperform the hysteretic noisy chaotic neural network by the interaction of hysteretic activation function and the noise compensation factor. One benchmark broadcast scheduling problem is used to verify the superiority of the proposed network. The simulation results show that the proposed network takes advantages over the noisy chaotic neural network, the hysteretic noisy chaotic neural network and other algorithms.


2007 ◽  
Vol 18 (02) ◽  
pp. 251-262 ◽  
Author(s):  
CHUNG KEUNG POON ◽  
FEIFENG ZHENG ◽  
YINFENG XU

We investigate an online scheduling problem motivated by pull-based data delivery systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast. We focus on the special case where preemption is allowed but aborted requests can never be satisfied again. The HEU algorithm of Woeginger [10] is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadlines. However, we show that when there are maximum bounds on the number and weight of requests at any time in the system, the HEU algorithm is not optimal. We then propose a modified algorithm, VAR, which is optimal for this case.


Sign in / Sign up

Export Citation Format

Share Document