Sciweavers

3122 search results - page 222 / 625
» A Theory of Network Equivalence
Sort
View
DEXAW
2004
IEEE
111views Database» more  DEXAW 2004»
15 years 10 months ago
A Complex Systems Approach to Service Discovery
Complex systems are those systems composed of many, often very simple, interacting autonomous entities. Interactions between these entities give rise to behaviour and patterns at t...
Ricky Robinson, Jadwiga Indulska
APIN
2005
94views more  APIN 2005»
15 years 6 months ago
Extension of Petri Nets for Representing and Reasoning with Tasks with Imprecise Durations
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
Stanislav Kurkovsky, Rasiah Loganantharaj
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 5 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
ICFCA
2007
Springer
15 years 10 months ago
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets
Different rule semantics have been successively defined in many contexts such as implications in artificial intelligence, functional dependencies in databases or association rules...
Marie Agier, Jean-Marc Petit
AI
2008
Springer
15 years 6 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson