Sciweavers

504 search results - page 22 / 101
» Complexity Properties of Restricted Abstract Argument System...
Sort
View
EPK
2006
114views Management» more  EPK 2006»
13 years 9 months ago
Verifying Properties of (Timed) Event Driven Process Chains by Transformation to Hybrid Automata
Abstract: Event-driven Process Chains (EPCs) are a commonly used modelling technique for design and documentation of business processes. Although EPCs have an easy-to-understand no...
Stefan Denne
MICCAI
2003
Springer
14 years 8 months ago
Quantitative Analysis of White Matter Fiber Properties along Geodesic Paths
Abstract. Diffusion Tensor Imaging (DTI) is becoming a routine magnetic resonance technique to study white matter properties and alterations of fiber integrity due to pathology. Th...
Pierre Fillard, John H. Gilmore, Joseph Piven, Wei...
FOIKS
2008
Springer
13 years 9 months ago
Aggregation of Attack Relations: A Social-Choice Theoretical Analysis of Defeasibility Criteria
Abstract. This paper analyzes the aggregation of different abstract attack relations over a common set of arguments. Each of those attack relations can be considered as the represe...
Fernando A. Tohmé, Gustavo Adrian Bodanza, ...
ENTCS
2008
146views more  ENTCS 2008»
13 years 7 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
UC
2005
Springer
14 years 1 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha