IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-27912-9_58.html
   My bibliography  Save this book chapter

A High Performance Algorithm on Uncertainty Computing

In: Current Trends in High Performance Computing and Its Applications

Author

Listed:
  • Suixiang Shi

    (Northeastern University, School of Information Science & Engineering)

  • Qing Li

    (Shanghai University, School of Computer Science & Engineering)

  • Lingyu Xu

    (Shanghai University, School of Computer Science & Engineering)

  • Dengwei Xia

    (Northeastern University, School of Information Science & Engineering)

  • Xiufeng Xia

    (Northeastern University, School of Information Science & Engineering)

  • Ge Yu

    (Northeastern University, School of Information Science & Engineering)

Abstract

In this paper, we develop a high performance algorithm which is adapted to uncertainty computing and give a new combination rules coming from the D–S and supply a gap that Dempster ignoranced. The evidence sources are adapted in different cases. The credibility of the evidence changes along with the different focus element. So, we give various credibility for every focus element to increase precision. The new method improves the precision and gets rid of disconvergent answer.

Suggested Citation

  • Suixiang Shi & Qing Li & Lingyu Xu & Dengwei Xia & Xiufeng Xia & Ge Yu, 2005. "A High Performance Algorithm on Uncertainty Computing," Springer Books, in: Wu Zhang & Weiqin Tong & Zhangxin Chen & Roland Glowinski (ed.), Current Trends in High Performance Computing and Its Applications, pages 437-441, Springer.
  • Handle: RePEc:spr:sprchp:978-3-540-27912-9_58
    DOI: 10.1007/3-540-27912-1_58
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-27912-9_58. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.