173 related articles for article (PubMed ID: 15901426)
1. Globally multimodal problem optimization via an estimation of distribution algorithm based on unsupervised learning of Bayesian networks.
Peña JM; Lozano JA; Larrañaga P
Evol Comput; 2005; 13(1):43-66. PubMed ID: 15901426
[TBL] [Abstract][Full Text] [Related]
2. Linkage problem, distribution estimation, and Bayesian networks.
Pelikan M; Goldberg DE; Cantú-Paz E
Evol Comput; 2000; 8(3):311-40. PubMed ID: 11001554
[TBL] [Abstract][Full Text] [Related]
3. Machine learning in prognosis of the femoral neck fracture recovery.
Kukar M; Kononenko I; Silvester T
Artif Intell Med; 1996 Oct; 8(5):431-51. PubMed ID: 8955855
[TBL] [Abstract][Full Text] [Related]
4. A genetic model: analysis and application to MAXSAT.
Bertoni A; Campadelli P; Carpentieri M; Grossi G
Evol Comput; 2000; 8(3):291-309. PubMed ID: 11001553
[TBL] [Abstract][Full Text] [Related]
5. Entropy optimization by the PFANN network: application to blind source separation.
Fiori S
Network; 1999 May; 10(2):171-86. PubMed ID: 10378190
[TBL] [Abstract][Full Text] [Related]
6. Adversarial search by evolutionary computation.
Hong TP; Huang KY; Lin WY
Evol Comput; 2001; 9(3):371-85. PubMed ID: 11522212
[TBL] [Abstract][Full Text] [Related]
7. Algebraic geometrical methods for hierarchical learning machines.
Watanabe S
Neural Netw; 2001 Oct; 14(8):1049-60. PubMed ID: 11681750
[TBL] [Abstract][Full Text] [Related]
8. Decision-support and intelligent tutoring systems in medical education.
Frize M; Frasson C
Clin Invest Med; 2000 Aug; 23(4):266-9. PubMed ID: 10981539
[TBL] [Abstract][Full Text] [Related]
9. Stochastic optimization algorithms of a Bayesian design criterion for Bayesian parameter estimation of nonlinear regression models: application in pharmacokinetics.
Merlé Y; Mentré F
Math Biosci; 1997 Aug; 144(1):45-70. PubMed ID: 9232968
[TBL] [Abstract][Full Text] [Related]
10. Clustering based on conditional distributions in an auxiliary space.
Sinkkonen J; Kaski S
Neural Comput; 2002 Jan; 14(1):217-39. PubMed ID: 11747539
[TBL] [Abstract][Full Text] [Related]
11. Constructive genetic algorithm for clustering problems.
Lorena LA; Furtado JC
Evol Comput; 2001; 9(3):309-27. PubMed ID: 11522209
[TBL] [Abstract][Full Text] [Related]
12. Artificial evolution: a new path for artificial intelligence?
Husbands P; Harvey I; Cliff D; Miller G
Brain Cogn; 1997 Jun; 34(1):130-59. PubMed ID: 9209759
[TBL] [Abstract][Full Text] [Related]
13. Methods for binary multidimensional scaling.
Rohde DL
Neural Comput; 2002 May; 14(5):1195-232. PubMed ID: 11972914
[TBL] [Abstract][Full Text] [Related]
14. Bayesian A* tree search with expected O(N) node expansions: applications to road tracking.
Coughlan JM; Yuille AL
Neural Comput; 2002 Aug; 14(8):1929-58. PubMed ID: 12180408
[TBL] [Abstract][Full Text] [Related]
15. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES).
Hansen N; Müller SD; Koumoutsakos P
Evol Comput; 2003; 11(1):1-18. PubMed ID: 12804094
[TBL] [Abstract][Full Text] [Related]
16. A Bayesian attractor network with incremental learning.
Sandberg A; Lansner A; Petersson KM; Ekeberg O
Network; 2002 May; 13(2):179-94. PubMed ID: 12061419
[TBL] [Abstract][Full Text] [Related]
17. A fast and convergent stochastic MLP learning algorithm.
Sakurai A
Int J Neural Syst; 2001 Dec; 11(6):573-83. PubMed ID: 11852440
[TBL] [Abstract][Full Text] [Related]
18. A computational study into the evolution of dual-route dynamics for affective processing.
den Dulk P; Heerebout BT; Phaf RH
J Cogn Neurosci; 2003 Feb; 15(2):194-208. PubMed ID: 12676057
[TBL] [Abstract][Full Text] [Related]
19. A species conserving genetic algorithm for multimodal function optimization.
Li JP; Balazs ME; Parks GT; Clarkson PJ
Evol Comput; 2002; 10(3):207-34. PubMed ID: 12227994
[TBL] [Abstract][Full Text] [Related]
20. A comparison study of self-adaptation in evolution strategies and real-coded genetic algorithms.
Kita H
Evol Comput; 2001; 9(2):223-41. PubMed ID: 11382357
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]