Sciweavers

670 search results - page 94 / 134
» Real Time Model Checking Using Timed Concurrent State Machin...
Sort
View
89
Voted
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 13 days ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
COLT
1995
Springer
15 years 4 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
131
Voted
ICLP
2004
Springer
15 years 5 months ago
Applying CLP to Predict Extra-Functional Properties of Component-Based Models
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
Olivier Defour, Jean-Marc Jézéquel, ...
105
Voted
JCNS
2010
90views more  JCNS 2010»
14 years 7 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
BPM
2008
Springer
217views Business» more  BPM 2008»
15 years 2 months ago
Detecting Regulatory Compliance for Business Process Models through Semantic Annotations
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...
Guido Governatori, Jörg Hoffmann, Shazia Wasi...