Workshop paper
Large Language Model Evaluation on Financial Benchmarks
Bing Zhang, Mikio Takeuchi, et al.
ICAIF 2024
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.
Bing Zhang, Mikio Takeuchi, et al.
ICAIF 2024
Dzung Phan, Vinicius Lima
INFORMS 2023
Yuta Tsuboi, Yuya Unno, et al.
AAAI 2011
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011