Alexander Stanoyevitch
Alexander Stanoyevitch has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Andre Diatta
Aix-Marseille Univ CNRS Centrale Marseille Institut Fresnel 13013 Marseille France
1 shared publication - Beverly Wang
Department of Pathology, University of California, Irvine, CA, USA
1 shared publication - David Shimizu
Department of Pathology, The Queen's Medical Center, 1301 Punchbowl Street, Honolulu, HI 96813, United States
1 shared publication - Di Lu
Department of Pathology and Laboratory Medicine, University of California, Irvine, Orange, CA 92868, USA
1 shared publication - Edwin S. Monuki
Department of Pathology & Laboratory Medicine, University of California Irvine, Irvine, CA, USA
1 shared publication - Fritz Lin
The Department of Pathology, University of California at Irvine, Irvine, CA 92868
1 shared publication
Latest Publications
- Open Access
- 1 July 2016
- Published by Elsevier in Human Pathology
- Vol. 53, 159-167
Serous carcinomatous component championed by heparin-binding EGF-like growth factor (HB-EGF) predisposing to metastasis and recurrence in stage I uterine malignant mixed mullerian tumor
- 1 July 2016
- Published by Elsevier in Human Pathology
- Vol. 53, 159-167
Open AccessSerous carcinomatous component championed by heparin-binding EGF-like growth factor (HB-EGF) predisposing to metastasis and recurrence in stage I uterine malignant mixed mullerian tumor
- Open Access
Distinguishing properties of weak slice conditions II
The slice condition and the more general weak slice conditions are geometric conditions on Euclidean space domains which have evolved over the last several years as a tool in various areas of analysis. This paper examines some of their finer distinctive properties.
Open AccessDistinguishing properties of weak slice conditions II
The slice condition and the more general weak slice conditions are geometric conditions on Euclidean space domains which have evolved over the last several years as a tool in various areas of analysis. This paper examines some of their finer distinctive properties.
- 1 March 2010
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 87 (3) , 476-490
Homogeneous genetic algorithms
A new type of genetic algorithm (GA) is developed to mitigate one or both of the following two major difficulties that traditional GAs may suffer: (1) when the number of ‘active genes’ needs to be held constant or kept within some prescribed range, and (2) when the set of genes is much larger than the set of active genes of feasible solutions under consideration. These homogeneous GAs use (unordered) sets to represent ‘active genes’ in chromosomes rather than strings, and a correspondingly natural crossover operator is introduced. ‘Homogeneous’ refers to the fact that, in contrast to traditional GAs where pairs of genes that are ‘close’ have better chances of being preserved under crossover, there is no notion of proximity between pairs of genes. Examples are provided that will demonstrate superior performance of these new GAs for some typical problems in which these difficulties arise.
- 1 March 2010
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 87 (3) , 476-490
Homogeneous genetic algorithms
A new type of genetic algorithm (GA) is developed to mitigate one or both of the following two major difficulties that traditional GAs may suffer: (1) when the number of ‘active genes’ needs to be held constant or kept within some prescribed range, and (2) when the set of genes is much larger than the set of active genes of feasible solutions under consideration. These homogeneous GAs use (unordered) sets to represent ‘active genes’ in chromosomes rather than strings, and a correspondingly natural crossover operator is introduced. ‘Homogeneous’ refers to the fact that, in contrast to traditional GAs where pairs of genes that are ‘close’ have better chances of being preserved under crossover, there is no notion of proximity between pairs of genes. Examples are provided that will demonstrate superior performance of these new GAs for some typical problems in which these difficulties arise.