Yixin Diao, Kevin M. Passino
IEEE Transactions on Fuzzy Systems
The expected depth of each key in the set of binary search trees formed from all sequences composed from a multiset {p1 · 1, p2 · 2, p3 · 3, ···, pn · n} is obtained, and hence the expected weight of such trees. The expected number of left-to-right local minima and the expected number of cycles in sequences composed from a multiset are then deduced from these results. © 1976, ACM. All rights reserved.
Yixin Diao, Kevin M. Passino
IEEE Transactions on Fuzzy Systems
Miao Guo, Yong Tao Pei, et al.
WCITS 2011
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Rina Dechter, Kalev Kask, et al.
AAAI/IAAI 2002