A probabilistic search algorithm for finding suboptimal branchings in mutually exclusive hypothesis graph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/kes/Davydov14
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/kes/Davydov14
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/M._V._Davydov
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.3233%2FKES-140302
>
foaf:
homepage
<
https://doi.org/10.3233/KES-140302
>
dc:
identifier
DBLP journals/kes/Davydov14
(xsd:string)
dc:
identifier
DOI doi.org%2F10.3233%2FKES-140302
(xsd:string)
dcterms:
issued
2014
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/kes
>
rdfs:
label
A probabilistic search algorithm for finding suboptimal branchings in mutually exclusive hypothesis graph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/M._V._Davydov
>
swrc:
number
4
(xsd:string)
swrc:
pages
247-253
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/kes/Davydov14/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/kes/Davydov14
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/kes/kes18.html#Davydov14
>
rdfs:
seeAlso
<
https://doi.org/10.3233/KES-140302
>
dc:
title
A probabilistic search algorithm for finding suboptimal branchings in mutually exclusive hypothesis graph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
18
(xsd:string)