Sciweavers

1300 search results - page 68 / 260
» Probabilistic logic with independence
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Information retrieval and machine learning for probabilistic schema matching
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Henrik Nottelmann, Umberto Straccia
IANDC
2006
117views more  IANDC 2006»
13 years 8 months ago
Statistical probabilistic model checking with a focus on time-bounded properties
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
Håkan L. S. Younes, Reid G. Simmons
TACAS
2004
Springer
132views Algorithms» more  TACAS 2004»
14 years 2 months ago
Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study
Numerical analysis based on uniformisation and statistical techniques based on sampling and simulation are two distinct approaches for transient analysis of stochastic systems. We ...
Håkan L. S. Younes, Marta Z. Kwiatkowska, Ge...
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
14 years 9 days ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
14 years 2 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker