These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
42. Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms. Serpell M; Smith JE Evol Comput; 2010; 18(3):491-514. PubMed ID: 20560757 [TBL] [Abstract][Full Text] [Related]
44. Efficient algorithm for level set method preserving distance function. Estellers V; Zosso D; Lai R; Osher S; Thiran JP; Bresson X IEEE Trans Image Process; 2012 Dec; 21(12):4722-34. PubMed ID: 22692909 [TBL] [Abstract][Full Text] [Related]
45. Adapting operator settings in genetic algorithms. Tuson A; Ross P Evol Comput; 1998; 6(2):161-84. PubMed ID: 10021745 [TBL] [Abstract][Full Text] [Related]
46. Testing and optimization of a semiautomatic prostate boundary segmentation algorithm using virtual operators. Ladak HM; Wang Y; Downey DB; Fenster A Med Phys; 2003 Jul; 30(7):1637-47. PubMed ID: 12906181 [TBL] [Abstract][Full Text] [Related]
47. An enhanced artificial bee colony algorithm (EABC) for solving dispatching of hydro-thermal system (DHTS) problem. Yu Y; Wu Y; Hu B; Liu X PLoS One; 2018; 13(1):e0189282. PubMed ID: 29324743 [TBL] [Abstract][Full Text] [Related]
48. Interior point algorithms: guaranteed optimality for fluence map optimization in IMRT. Aleman DM; Glaser D; Romeijn HE; Dempsey JF Phys Med Biol; 2010 Sep; 55(18):5467-82. PubMed ID: 20798458 [TBL] [Abstract][Full Text] [Related]
49. Intensifying the search-based optimization of product line architectures with crossover operators. da Silva DF; Okada LF; Assunção WKG; Colanzi TE Empir Softw Eng; 2022; 27(7):166. PubMed ID: 36159892 [TBL] [Abstract][Full Text] [Related]
50. Memetic algorithms for the unconstrained binary quadratic programming problem. Merz P; Katayama K Biosystems; 2004 Dec; 78(1-3):99-118. PubMed ID: 15555762 [TBL] [Abstract][Full Text] [Related]
51. Learning to solve planning problems efficiently by means of genetic programming. Aler R; Borrajo D; Isasi P Evol Comput; 2001; 9(4):387-420. PubMed ID: 11709102 [TBL] [Abstract][Full Text] [Related]
52. Differential evolution with ranking-based mutation operators. Gong W; Cai Z IEEE Trans Cybern; 2013 Dec; 43(6):2066-81. PubMed ID: 23757516 [TBL] [Abstract][Full Text] [Related]
53. Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. Wang Y; Cai Z; Guo G; Zhou Y IEEE Trans Syst Man Cybern B Cybern; 2007 Jun; 37(3):560-75. PubMed ID: 17550112 [TBL] [Abstract][Full Text] [Related]
54. Creation of Numerical Constants in Robust Gene Expression Programming. Fajfar I; Tuma T Entropy (Basel); 2018 Oct; 20(10):. PubMed ID: 33265845 [TBL] [Abstract][Full Text] [Related]
55. Formal reasoning about systems biology using theorem proving. Rashid A; Hasan O; Siddique U; Tahar S PLoS One; 2017; 12(7):e0180179. PubMed ID: 28671950 [TBL] [Abstract][Full Text] [Related]
56. Formal modeling and verification of fractional order linear systems. Zhao C; Shi L; Guan Y; Li X; Shi Z ISA Trans; 2016 May; 62():87-93. PubMed ID: 27126601 [TBL] [Abstract][Full Text] [Related]
57. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation. Wang Z; Huang D; Meng H; Tang C Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964 [TBL] [Abstract][Full Text] [Related]
58. An improved bio-inspired algorithm for the directed shortest path problem. Zhang X; Zhang Y; Deng Y Bioinspir Biomim; 2014 Nov; 9(4):046016. PubMed ID: 25405318 [TBL] [Abstract][Full Text] [Related]
59. An Evolutionary Multiobjective Carpool Algorithm Using Set-Based Operator Based on Simulated Binary Crossover. Lin JJ; Huang SC; Jiau MK IEEE Trans Cybern; 2019 Sep; 49(9):3432-3442. PubMed ID: 30028720 [TBL] [Abstract][Full Text] [Related]
60. A new crossover operator in genetic programming for object classification. Zhang M; Gao X; Lou W IEEE Trans Syst Man Cybern B Cybern; 2007 Oct; 37(5):1332-43. PubMed ID: 17926713 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]