Sciweavers

761 search results - page 147 / 153
» A Reactive Approach to Explanation
Sort
View
ICFP
2009
ACM
15 years 10 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
ICALP
2009
Springer
15 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
76
Voted
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
15 years 4 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point
SIGCOMM
2009
ACM
15 years 4 months ago
Resonance: dynamic access control for enterprise networks
Enterprise network security is typically reactive, and it relies heavily on host security and middleboxes. This approach creates complicated interactions between protocols and sys...
Ankur Kumar Nayak, Alex Reimers, Nick Feamster, Ru...
ABIALS
2008
Springer
15 years 4 months ago
The Cognitive Body: From Dynamic Modulation to Anticipation
Abstract— Starting from the situated and embodied perspective on the study of biological cognition as a source of inspiration, this paper programmatically outlines a path towards...
Alberto Montebelli, Robert Lowe, Tom Ziemke