Sciweavers

793 search results - page 156 / 159
» Argumentation and standards of proof
Sort
View
AIPS
2009
15 years 24 days ago
A Semantics for HTN Methods
Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploi...
Robert P. Goldman
CRYPTO
2010
Springer
171views Cryptology» more  CRYPTO 2010»
15 years 24 days ago
Credential Authenticated Identification and Key Exchange
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
Jan Camenisch, Nathalie Casati, Thomas Groß,...
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 11 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
ENTCS
2006
168views more  ENTCS 2006»
14 years 11 months ago
A Functional Programming Framework for Latency Insensitive Protocol Validation
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla...
SIAMCO
2008
108views more  SIAMCO 2008»
14 years 11 months ago
A Viability Theorem for Morphological Inclusions
The aim of this paper is to adapt the Viability Theorem from differential inclusions (governing the evolution of vectors in a finite dimensional space) to so-called morphological i...
Thomas Lorenz