Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms (Q2506950): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ijar.2005.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981844345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds on finite populations of interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Software with Result Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outlier detection under interval uncertainty: algorithmic solvability and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4295394 / rank
 
Normal rank

Latest revision as of 20:33, 24 June 2024

scientific article
Language Label Description Also known as
English
Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms
scientific article

    Statements

    Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2006
    0 references
    quadratic optimization problem
    0 references

    Identifiers