Sciweavers

2273 search results - page 77 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
SCW
2006
IEEE
15 years 3 months ago
Implementation of a Complex Event Engine for the Web
One of the key aspects in the implementation of reactive behaviour in the web and, most importantly, in the semantic web is the development of event detection engines. An event en...
José Júlio Alferes, Gaston E. Tagni
AAAI
2008
15 years 5 days ago
Generating Application-Specific Benchmark Models for Complex Systems
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
Jun Wang, Gregory M. Provan
DAM
2006
136views more  DAM 2006»
14 years 10 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen
ANCS
2009
ACM
14 years 7 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
CAV
2010
Springer
181views Hardware» more  CAV 2010»
15 years 1 months ago
Policy Monitoring in First-Order Temporal Logic
We present an approach to monitoring system policies. As a specification language, we use an expressive fragment of a temporal logic, which can be effectively monitored. We repor...
David A. Basin, Felix Klaedtke, Samuel Müller