5423 search results - page 739 / 1085 » Denial-of-service in automation systems |
157
Voted
CADE
2001
Springer
16 years 7 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
160
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
—In this paper, we introduce NNexus, a generalization of the automatic linking engine of Noosphere (at PlanetMath.org) and the first system that automates the process of linking...
193
Voted
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
—Towards a data-centric workflow approach, we introduce an artifact model to capture data and workflow management activities in distributed settings. The model is built on Acti...
161
Voted
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We describe a scalable and general-purpose framework for auto-tuning compiler-generated code. We combine Active Harmony’s parallel search backend with the CHiLL compiler transfo...
199
Voted
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
Systems that can immediately react to their inputs may suffer from cyclic dependencies between their actions and the corresponding trigger conditions. For this reason, causality an...