The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
We consider the optimal computing budget allocation (OCBA) problem where the simulated designs are correlated. The exact optimal allocation is presented for two designs, and an ap...
Michael C. Fu, Jian-Qiang Hu, Chun-Hung Chen, Xiao...
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
While bit-based, order-based and real-valued genetic algorithms have been wellstudied in the literature, the xed-length subset representation has received relativelylittle attenti...
Kelly D. Crawford, Cory J. Hoelting, Roger L. Wain...
We propose a quantization design technique (estimator) suitable for new compressed sensing sampling systems whose ultimate goal is classification or detection. The design is base...