Sciweavers

953 search results - page 52 / 191
» Constraint Based Transformation Theory
Sort
View
DATE
2008
IEEE
158views Hardware» more  DATE 2008»
15 years 4 months ago
Performance Analysis of SoC Architectures Based on Latency-Rate Servers
This paper presents a method for static performance analysis of SoC architectures. The method is based on a network calculus theory known as LR servers. This network calculus is e...
Jelte Peter Vink, Kees van Berkel, Pieter van der ...
FUIN
2008
108views more  FUIN 2008»
14 years 8 months ago
Learning Ground CP-Logic Theories by Leveraging Bayesian Network Learning Techniques
Causal relations are present in many application domains. Causal Probabilistic Logic (CP-logic) is a probabilistic modeling language that is especially designed to express such rel...
Wannes Meert, Jan Struyf, Hendrik Blockeel
WWW
2005
ACM
15 years 10 months ago
Expressiveness of XSDs: from practice to theory, there and back again
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...
Geert Jan Bex, Wim Martens, Frank Neven, Thomas Sc...
ENTCS
2008
153views more  ENTCS 2008»
14 years 9 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
CORR
1998
Springer
85views Education» more  CORR 1998»
14 years 9 months ago
The Proper Treatment of Optimality in Computational Phonology
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994, the n...
Lauri Karttunen