This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n13http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://purl.org/net/nknouf/ns/bibtex#
n12http://localhost/temp/predkladatel/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F08%3A00155405%21RIV10-MSM-21230___/
n6http://linked.opendata.cz/ontology/domain/vavai/
n15https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F08%3A00155405%21RIV10-MSM-21230___
rdf:type
n6:Vysledek skos:Concept
dcterms:description
We study and review geometrical properties of the set of the prob- abilities dominated by a submodular coherent upper probability (a possibility measure, in particular) on a finite set. We mention that there exists a polynomial algorithm for vertex enumeration. A new upper bound for the number of vertices in case of possibility measures is derived. We study and review geometrical properties of the set of the prob- abilities dominated by a submodular coherent upper probability (a possibility measure, in particular) on a finite set. We mention that there exists a polynomial algorithm for vertex enumeration. A new upper bound for the number of vertices in case of possibility measures is derived.
dcterms:title
Geometry of Cores of Submodular Coherent Upper Probabilities Geometry of Cores of Submodular Coherent Upper Probabilities
skos:prefLabel
Geometry of Cores of Submodular Coherent Upper Probabilities Geometry of Cores of Submodular Coherent Upper Probabilities
skos:notation
RIV/68407700:21230/08:00155405!RIV10-MSM-21230___
n3:aktivita
n17:V
n3:aktivity
V
n3:dodaniDat
n9:2010
n3:domaciTvurceVysledku
n10:2462214
n3:druhVysledku
n7:D
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
369303
n3:idVysledku
RIV/68407700:21230/08:00155405
n3:jazykVysledku
n4:eng
n3:klicovaSlova
Coherent upper probability; Possibility measure; Core
n3:klicoveSlovo
n5:Core n5:Coherent%20upper%20probability n5:Possibility%20measure
n3:kontrolniKodProRIV
[801293EB3E7F]
n3:mistoKonaniAkce
Toulouse
n3:mistoVydani
Berlin
n3:nazevZdroje
SOFT METHODS FOR HANDLING VARIABILITY AND IMPRECISION
n3:obor
n20:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:rokUplatneniVysledku
n9:2008
n3:tvurceVysledku
Kroupa, Tomáš
n3:typAkce
n13:WRD
n3:wos
000261348900037
n3:zahajeniAkce
2008-09-08+02:00
s:issn
1615-3871
s:numberOfPages
7
n19:hasPublisher
Springer-Verlag
n15:isbn
978-3-540-85026-7
n12:organizacniJednotka
21230