15033 search results - page 279 / 3007 » Complexity Theory and Algorithms |
176
click to vote
DEBS
2010
ACM
15 years 7 months ago
2010
ACM
For Complex Event Processing (CEP), the synergy with Predictive Analytics (PA) is a promising research direction. In this paper we focus on the inclusion of PA technologies into C...
144
click to vote
WSC
2004
15 years 6 months ago
2004
One feature of many naturally occurring or engineered complex systems is tremendous variability in event sizes. To account for it, the behavior of these systems is often described...
154
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
133
click to vote
IANDC
2010
15 years 3 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
160
click to vote
SIGAL
1990
15 years 9 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...