The performance of consultation methods, i.e., majority voting, the optimistic selection rule, and the pseudo-random number (PRN) ensemble method, are examined in computer chess using 2180 chess problems. Here, the optimistic selection rule selects a program that returns the highest search value, and the PRN ensemble consists of multiple individual copies of one base program, and each copy is d...

This paper presents a set of architecturally and workloadinspired algorithmic and engineering improvements to the popular Memcached system that substantially improve both its memory efficiency and throughput. These techniques—optimistic cuckoo hashing, a compact LRU-approximating eviction algorithm based upon CLOCK, and comprehensive implementation of optimistic locking—enable the resulting sys...

This paper studies an alternating renewal process when on-off times are random fuzzy variables. We provide a theorem concerning the long-term average expected service times of customers. Here, we do not use the α0-pessimistic value and the α0-optimistic value of fuzzy variables, we simulate the expected value of random fuzzy variables based on fuzzy simulation to calculate the long-term average...

Personal predictions are often optimistically biased. This simple observation has troubling implications for psychologists, economists, and decision theorists concerned with rationality and the accuracy of self-knowledge (Armor & Taylor, 2002; Krizan & Windschitl, 2007; Sweeny, Carroll, & Shepperd, 2006). However, normative conclusions about the impropriety of optimistic bias rest on an unteste...