메뉴 건너뛰기




Volumn , Issue , 2004, Pages 130-135

Probabilities, intervals, what next? extension of interval computations to situations with partial information about probabilities

Author keywords

Indirect measurements; Interval computations; Total error

Indexed keywords

DATA HANDLING;

EID: 84909988007     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (14)
  • 5
    • 84910012379 scopus 로고    scopus 로고
    • Probabilities, intervals, what next? Optimization problems related to extension of interval computations to situations with partial information about probabilities
    • to appear
    • V. Kreinovich, "Probabilities, Intervals, What Next? Optimization Problems Related to Extension of Interval Computations to Situations with Partial Information about Probabilities", Journal of Global Optimization (to appear).
    • Journal of Global Optimization
    • Kreinovich, V.1
  • 7
    • 0142219402 scopus 로고    scopus 로고
    • Exact upper bound on the mean of the product of many random variables with known expectations
    • V. Kreinovich, S.A. Person, and L. Ginzburg, "Exact Upper Bound on the Mean of the Product of Many Random Variables With Known Expectations", Reliable Computing, 9(6), 441-463, 2003.
    • (2003) Reliable Computing , vol.9 , Issue.6 , pp. 441-463
    • Kreinovich, V.1    Person, S.A.2    Ginzburg, L.3
  • 9
    • 33745327042 scopus 로고    scopus 로고
    • Computational complexity and feasibility of data processing and interval computations, with extension to cases when we have partial information about probabilities
    • In: V. Brattka, M. Schroeder, K. Weihrauch, N. Zhong Cincinnati, Ohio, USA, August 28-30
    • V. Kreinovich and L. Longpré, "Computational complexity and feasibility of data processing and interval computations, with extension to cases when we have partial information about probabilities", In: V. Brattka, M. Schroeder, K. Weihrauch, N. Zhong, Proc. of the Conf. on Computability and Compledty in Analysis CCA 2003, Cincinnati, Ohio, USA, August 28-30, 2003, pp. 19-54.
    • (2003) Proc. Of the Conf. On Computability and Compledty in Analysis CCA 2003 , pp. 19-54
    • Kreinovich, V.1    Longpré, L.2
  • 12
    • 0142202554 scopus 로고
    • Absolute bounds on the mean and standard deviation of transformed data for constant-signderivative transformations
    • N.C. Rowe, "Absolute bounds on the mean and standard deviation of transformed data for constant-signderivative transformations", SIAM Journal of Scientific Statistical Computing, 9, 1098-1113, 1988.
    • (1988) SIAM Journal of Scientific Statistical Computing , vol.9 , pp. 1098-1113
    • Rowe, N.C.1
  • 13
    • 1342278541 scopus 로고    scopus 로고
    • Error estimations for indirect measurements: Randomized vs. Deterministic algorithms for 'black-box' programs
    • S. Rajasekaran Kluwer
    • R. Trejo, V. Kreinovich, "Error Estimations for Indirect Measurements: Randomized vs. Deterministic Algorithms For 'Black-Box' Programs", In: S. Rajasekaran et al. (eds.), Handbook on Randomized Computing, Kluwer, 2001, pp. 673-729.
    • (2001) Handbook on Randomized Computing , pp. 673-729
    • Trejo, R.1    Kreinovich, V.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.