Sciweavers

2273 search results - page 160 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
86
Voted
RTA
2010
Springer
15 years 2 months ago
Polynomially Bounded Matrix Interpretations
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
Johannes Waldmann
93
Voted
COOPIS
2000
IEEE
15 years 1 months ago
Workflow Modeling Using Proclets
The focus of traditional workflow management systems is on control flow within one process definition, that describes how a single case (i.e., workflow instance) is handled in isol...
Wil M. P. van der Aalst, Paulo Barthelmess, Claren...
DAC
2009
ACM
15 years 1 months ago
GPU friendly fast Poisson solver for structured power grid network analysis
In this paper, we propose a novel simulation algorithm for large scale structured power grid networks. The new method formulates the traditional linear system as a special two-dim...
Jin Shi, Yici Cai, Wenting Hou, Liwei Ma, Sheldon ...
ECAI
2008
Springer
14 years 12 months ago
XTT+ Rule Design Using the ALSV(FD)
This paper presents advances in Set Attributive Logic and its application to develop tabular rule-based systems within the XTT framework. The primary goal is to extend the expressi...
Grzegorz J. Nalepa, Antoni Ligeza
CIDR
2007
128views Algorithms» more  CIDR 2007»
14 years 11 months ago
Cayuga: A General Purpose Event Monitoring System
We describe the design and implementation of the Cornell Cayuga System for scalable event processing. We present a query language based on Cayuga Algebra for naturally expressing ...
Alan J. Demers, Johannes Gehrke, Biswanath Panda, ...