Estimating the Expected Cost of Function Evaluation Strategies

  • Rebi Daldal
  • Zahed Shahmoradi
  • Tonguç ÜnlüyurtEmail author
Conference paper
Part of the Lecture Notes in Management and Industrial Engineering book series (LNMIE)


We propose a sampling-based method to estimate the expected cost of a given strategy that evaluates a given Boolean function. In general, computing the exact expected cost of a strategy that evaluates a Boolean function obtained by some algorithm may take exponential time. Consequently, it may not be possible to assess the quality of the solutions obtained by different algorithms in an efficient manner. We demonstrate the effectiveness of the estimation method in random instances for algorithms developed for certain functions where the expected cost can be computed in polynomial time. We show that the absolute percentage errors are very small even for samples of moderate size. We propose that in order to compare strategies obtained by different algorithms, it is practically sufficient to compare the estimates when the exact computation of the expected cost is not possible.


Function evaluation Sequential testing Cost estimation Monte Carlo methods 



The authors gratefully acknowledge the support provided by TUBITAK 1001 programme, project number 113M478.


  1. Ben-Dov, Y. (1981). Optimal testing procedures for special structures of coherent systems. Management Science, 27(12), 1410–1420.CrossRefGoogle Scholar
  2. Boros, E., & Ünlüyurt, T. (2000). Sequential testing of series parallel systems of small depth. In Laguna & Velarde (Eds.), Computing tools for modeling, optimization and simulation (pp. 39–74). Boston: Kluwer Academic Publishers.Google Scholar
  3. Chang, M., Shi, W., & Fuchs, W. K. (1990). Optimal diagnosis procedures for k-out-of-n structures. IEEE Transactions on Computers, 39(4), 559–564.CrossRefGoogle Scholar
  4. Crama, Y., & Hammer, P. L. (2011). Boolean functions: Theory, algorithms and applications. Cambridge University Press.Google Scholar
  5. Duffuaa, S., & Raouf, A. (1990). An optimal sequence in multicharacteristics inspection. Journal of Optimization Theory and Applications, 67(1), 79–87.MathSciNetCrossRefGoogle Scholar
  6. Greiner, R., Hayward, R., Jankowska, M., & Molloy, M. (2006). Finding optimal satisficing strategies for and-or trees. Artificial Intelligence, 170, 19–58.MathSciNetCrossRefGoogle Scholar
  7. Mitten, L. G. (1960). An analytic solution to the least cost testing sequence problem. Journal of Industrial Engineering 17.Google Scholar
  8. Reyck, B. D., & Leus, R. (2008). R&D-project scheduling when activities may fail. IIE Transactions, 40(4), 367–384.CrossRefGoogle Scholar
  9. Ünlüyurt, T. (2004). Sequential testing of complex systems: A review. Discrete Applied Mathematics, 142(1–3), 189–205.MathSciNetCrossRefGoogle Scholar
  10. Ünlüyurt, T., & Boros, E. (2009). A note on optimal resource allocation for security in reliable systems. European Journal of Operational Research, 199(2), 601–603.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Rebi Daldal
    • 1
    • 3
  • Zahed Shahmoradi
    • 2
    • 3
  • Tonguç Ünlüyurt
    • 3
    Email author
  1. 1.University of CaliforniaBerkeleyUSA
  2. 2.University of HoustonHoustonUSA
  3. 3.Faculty of Engineering and Natural SciencesSabanci UniversityIstanbulTurkey

Personalised recommendations