Sciweavers

1157 search results - page 196 / 232
» Descriptive Complexity and Model Checking
Sort
View
SCP
2000
119views more  SCP 2000»
13 years 8 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
ICFEM
2005
Springer
14 years 2 months ago
A Compositional Framework for Service Interaction Patterns and Interaction Flows
We provide precise high-level models for eight fundamental service interaction patterns, together with schemes for their composition into complex service-based business process int...
Alistair P. Barros, Egon Börger
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 29 days ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
ATAL
2003
Springer
14 years 1 months ago
Behaviors that emerge from emotion and cognition: implementation and evaluation of a symbolic-connectionist architecture
This paper describes the implementation and evaluation of a framework for modeling emotions in complex, decision-making agents. Sponsored by U.S. Army Research Institute (ARI), th...
Amy E. Henninger, Randolph M. Jones, Eric Chown
NIPS
2000
13 years 10 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek