Asymptotic variance of random symmetric digital search trees

Autor: Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas

Publikováno v: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 2 (2010)

Dedicated to the 60th birthday of Philippe Flajolet

Externí odkaz: https://doaj.org/article/030c55db589d4322b830a2c47209c99c

Efficient maxima-finding algorithms for random planar samples

Autor: Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai

Publikováno v: Discrete Mathematics & Theoretical Computer Science, Vol 6, Iss 1 (2003)

We collect major known algorithms in the literature for finding the maxima of multi-dimensional points and provide a simple classification. Several new algorithms are proposed. In particular, we give a new maxima-finding algorithm with expected compl

Externí odkaz: https://doaj.org/article/5659dcc3490d44c8a1981ff03b517495

Probabilistic Analysis of the (1+1)-Evolutionary Algorithm

Autor: Nicolas Rolin, Hsien-Kuei Hwang, Alois Panholzer, Tsung-Hsi Tsai, Wei-Mei Chen

Publikováno v: Evolutionary Computation. 26:299-345

We give a detailed analysis of the cost used by the (1+1)-evolutionary algorithm. The problem has been approached in the evolutionary algorithm literature under various views, formulation and degree of rigor. Our asymptotic approximations for the mea

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3c9f90212a2763225ea3c5cdf9ba65e
https://doi.org/10.1162/evco_a_00212

From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader

Autor: Hsien-Kuei Hwang, Yoshiaki Itoh, Michael Fuchs

Publikováno v: Journal of Applied Probability. 54:213-235

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarit

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0fd8197d59f18a50511b61bd30fe0cd4
https://doi.org/10.1017/jpr.2016.96

Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools

Autor: Hsien-Kuei Hwang, Carsten Witt

Publikováno v: Hwang, H-K & Witt, C 2019, Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools . in Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms . Association for Computing Machinery, pp. 1-12, 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Potsdam, Brandenburg, Germany, 27/08/2019 . https://doi.org/10.1145/3299904.3340302
FOGA

The expected running time of the classical (1+1) EA on the OneMax benchmark function has recently been determined by Hwang et al. (2018) up to additive errors of $O((\log n)/n)$. The same approach proposed there also leads to a full asymptotic expans

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::855bb8de1639f8e7c1c1677ca9d8a1a6
http://arxiv.org/abs/1906.09047