Sciweavers

11716 search results - page 124 / 2344
» Computable symbolic dynamics
Sort
View
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
16 years 1 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol
CSFW
2006
IEEE
16 years 14 days ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
ICCI
1993
15 years 10 months ago
Pattern Matching for Case Analysis: A Computational Definition of Closeness
We propose a conceptually and technically neat method to identify known semantic patterns close to a novel pattern. This occurs in the context of a system to acquire knowledge inc...
Sylvain Delisle, Terry Copeck, Stan Szpakowicz, Ke...
INFORMATICALT
2008
123views more  INFORMATICALT 2008»
15 years 6 months ago
A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities
Abstract. A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle `The part i...
Yaroslav D. Sergeyev
AIEDAM
2002
100views more  AIEDAM 2002»
15 years 6 months ago
Drawing marks, acts, and reacts: Toward a computational sketching interface for architectural design
Architects use sketching and diagramming in their design process to perform functional reasoning, formal arrangements, analogy transfer, structure mapping, and knowledge acquisiti...
Ellen Yi-Luen Do