Sciweavers

6799 search results - page 251 / 1360
» The Tao of Modeling Spaces
Sort
View
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
15 years 7 months ago
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
Damien Woods
UC
2005
Springer
15 years 7 months ago
Lower Bounds on the Computational Power of an Optical Model of Computation
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
Damien Woods, J. Paul Gibson
ESORICS
2003
Springer
15 years 7 months ago
An On-the-Fly Model-Checker for Security Protocol Analysis
We introduce the on-the-fly model-checker OFMC, a tool that combines two methods for analyzing security protocols. The first is the use of lazy data-types as a simple way of buil...
David A. Basin, Sebastian Mödersheim, Luca Vi...
IWANN
1999
Springer
15 years 6 months ago
A Modular Attractor Model of Semantic Access
This paper presents results from lesion experiments on a modular attractor neural network model of semantic access. Real picture data forms the basis of perceptual input to the mod...
William Power, Ray J. Frank, D. John Done, Neil Da...
IANDC
1998
72views more  IANDC 1998»
15 years 1 months ago
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
Maria Paola Bonacina, Jieh Hsiang