Sciweavers

393 search results - page 45 / 79
» Defining Models - Meta Models versus Graph Grammars
Sort
View
DEON
2006
Springer
15 years 1 months ago
Strategic Deontic Temporal Logic as a Reduction to ATL, with an Application to Chisholm's Scenario
In this paper we extend earlier work on deontic deadlines in CTL to the framework of alternating time temporal logic (ATL). The resulting setting enables us to model several concep...
Jan Broersen
COLT
2008
Springer
14 years 11 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
CP
2009
Springer
15 years 10 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
71
Voted
TPDS
2008
96views more  TPDS 2008»
14 years 9 months ago
Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
DAC
2009
ACM
15 years 10 months ago
WCET-aware register allocation based on graph coloring
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
Heiko Falk