| 1. Identity statement | |
| Reference Type | Journal Article |
| Site | mtc-m16.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | 6qtX3pFwXQZ3r59YDa/H6kvP |
| Repository | sid.inpe.br/iris@1916/2005/08.08.11.54 (restricted access) |
| Last Update | 2005:08.08.03.00.00 (UTC) marciana |
| Metadata Repository | sid.inpe.br/iris@1916/2005/08.08.11.54.46 |
| Metadata Last Update | 2019:03.22.13.55.47 (UTC) marciana |
| Secondary Key | INPE-12931-PRE/8210 |
| ISSN | 0899-1499 1091-9856 |
| Label | self-archiving-INPE-MCTIC-GOV-BR |
| Citation Key | DugatSand:1994:CoHiTr |
| Title | Complexity of Hierarchical Trees in Evidence Theory  |
| Project | Processamento, manipulação, exploração e análise avançada de dados |
| Year | 1994 |
| Access Date | 2024, Apr. 28 |
| Secondary Type | PRE PI |
| Number of Files | 1 |
| Size | 1452 KiB |
| 2. Context | |
| Author | 1 Dugat, Vicent 2 Sandri, Sandra Aparecida |
| Resume Identifier | 1 2 8JMKD3MGP5W/3E3JEJL |
| Group | 1 2 LAC-INPE-MCT-BR |
| Affiliation | 1 IRIT.UPS 2 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada, (INPE, LAC) |
| Journal | ORSA Journal on Computig |
| Volume | 6 |
| Number | 1 |
| Pages | 37-48 |
| History (UTC) | 2005-08-08 11:54:47 :: sergio -> administrator :: 2006-09-28 22:35:27 :: administrator -> sergio :: 2008-01-07 12:49:50 :: sergio -> marciana :: 2008-01-08 17:38:50 :: marciana -> administrator :: 2018-06-05 01:28:30 :: administrator -> marciana :: 1994 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Content Type | External Contribution |
| Version Type | publisher |
| Keywords | COMPUTER SCIENCE Hierarchical tree Algorithms COMPUTAÇÃO APLICADA Árvore hierárquica Algorítmos |
| Abstract | In this article we propose a structure called hierarchical tree to reduce the complexity the dempsters rule fo combinationh in evidence theory. Our algorithm is bounded by O(2 2n-2) in the worst case versus O(2 2n) for the brute-force algorithm. We can hope for a better average complexity. Furthermore, we propose algorithms based on hierarchical trees to nreduce the complexity of the computation of Bel, Pl and Q functions. |
| Area | COMP |
| Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Complexity of Hierarchical... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| Language | en |
| Target File | complexity hierarchical.pdf |
| User Group | administrator marciana sergio |
| Visibility | shown |
| Copy Holder | SID/SCD |
| Read Permission | deny from all and allow from 150.163 |
| Update Permission | not transferred |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
| Dissemination | WEBSCI; PORTALCAPES; COMPENDEX. |
| Host Collection | sid.inpe.br/banon/2003/08.15.17.40 |
| 6. Notes | |
| Empty Fields | alternatejournal archivingpolicy archivist callnumber copyright creatorhistory descriptionlevel doi e-mailaddress electronicmailaddress format isbn lineage mark mirrorrepository month nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url |
| 7. Description control | |
| e-Mail (login) | marciana |
| update | |