Anytime propagation algorithm for min-based possibilistic graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/soco/AmorBM03
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/soco/AmorBM03
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Khaled_Mellouli
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nahla_Ben_Amor
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Salem_Benferhat
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00500-002-0255-x
>
foaf:
homepage
<
https://doi.org/10.1007/s00500-002-0255-x
>
dc:
identifier
DBLP journals/soco/AmorBM03
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00500-002-0255-x
(xsd:string)
dcterms:
issued
2003
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/soco
>
rdfs:
label
Anytime propagation algorithm for min-based possibilistic graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Khaled_Mellouli
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nahla_Ben_Amor
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Salem_Benferhat
>
swrc:
number
2
(xsd:string)
swrc:
pages
150-161
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/soco/AmorBM03/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/soco/AmorBM03
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/soco/soco8.html#AmorBM03
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00500-002-0255-x
>
dc:
subject
Graphical models; Possibility theory; Anytime propagation algorithm
(xsd:string)
dc:
title
Anytime propagation algorithm for min-based possibilistic graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
8
(xsd:string)