TH-A-116-09: A Novel Prior-Knowledge-Based Optimization Algorithm for Automatic Treatment Planning and Adaptive Radiotherapy Re-Planning

2013 ◽  
Vol 40 (6Part32) ◽  
pp. 530-530 ◽  
Author(s):  
M Zarepisheh ◽  
T Long ◽  
N Li ◽  
E Romeijn ◽  
X Jia ◽  
...  
2014 ◽  
Vol 41 (6Part1) ◽  
pp. 061711 ◽  
Author(s):  
Masoud Zarepisheh ◽  
Troy Long ◽  
Nan Li ◽  
Zhen Tian ◽  
H. Edwin Romeijn ◽  
...  

2013 ◽  
Vol 40 (6Part32) ◽  
pp. 534-534 ◽  
Author(s):  
Q Gautier ◽  
Z Tian ◽  
Y Graves ◽  
N Li ◽  
M Zarepisheh ◽  
...  

2013 ◽  
Vol 40 (6Part21) ◽  
pp. 356-356
Author(s):  
N Li ◽  
Q Gautier ◽  
M Zarepisheh ◽  
Y Graves ◽  
Z Tian ◽  
...  

2015 ◽  
Vol 42 (6Part8) ◽  
pp. 3280-3280
Author(s):  
H Wang ◽  
L Xing

Author(s):  
Prachi Agrawal ◽  
Talari Ganesh ◽  
Ali Wagdy Mohamed

AbstractThis article proposes a novel binary version of recently developed Gaining Sharing knowledge-based optimization algorithm (GSK) to solve binary optimization problems. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. A binary version of GSK named novel binary Gaining Sharing knowledge-based optimization algorithm (NBGSK) depends on mainly two binary stages: binary junior gaining sharing stage and binary senior gaining sharing stage with knowledge factor 1. These two stages enable NBGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. Moreover, to enhance the performance of NBGSK and prevent the solutions from trapping into local optima, NBGSK with population size reduction (PR-NBGSK) is introduced. It decreases the population size gradually with a linear function. The proposed NBGSK and PR-NBGSK applied to set of knapsack instances with small and large dimensions, which shows that NBGSK and PR-NBGSK are more efficient and effective in terms of convergence, robustness, and accuracy.


2021 ◽  
Vol 22 (3) ◽  
pp. 119-130
Author(s):  
Jose R. Teruel ◽  
Sameer Taneja ◽  
Paulina E. Galavis ◽  
K. Sunshine Osterman ◽  
Allison McCarthy ◽  
...  

2017 ◽  
Vol 221 ◽  
pp. 427-436 ◽  
Author(s):  
Anthony L. Schroeder ◽  
Dalma Martinović-Weigelt ◽  
Gerald T. Ankley ◽  
Kathy E. Lee ◽  
Natalia Garcia-Reyero ◽  
...  

2018 ◽  
Vol 32 (14) ◽  
pp. 1850166 ◽  
Author(s):  
Lilin Fan ◽  
Kaiyuan Song ◽  
Dong Liu

Semi-supervised community detection is an important research topic in the field of complex network, which incorporates prior knowledge and topology to guide the community detection process. However, most of the previous work ignores the impact of the noise from prior knowledge during the community detection process. This paper proposes a novel strategy to identify and remove the noise from prior knowledge based on harmonic function, so as to make use of prior knowledge more efficiently. Finally, this strategy is applied to three state-of-the-art semi-supervised community detection methods. A series of experiments on both real and artificial networks demonstrate that the accuracy of semi-supervised community detection approach can be further improved.


Sign in / Sign up

Export Citation Format

Share Document