Sciweavers

998 search results - page 28 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
POPL
2006
ACM
14 years 7 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
DSN
2005
IEEE
14 years 1 months ago
Assured Reconfiguration of Fail-Stop Systems
Hardware dependability improvements have led to a situation in which it is sometimes unnecessary to employ extensive hardware replication to mask hardware faults. Expanding upon o...
Elisabeth A. Strunk, John C. Knight, M. Anthony Ai...
ICAC
2005
IEEE
14 years 1 months ago
Decentralised Autonomic Computing: Analysing Self-Organising Emergent Behaviour using Advanced Numerical Methods
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess systemwide behaviour. Such decentralised systems are characterised by the la...
Tom De Wolf, Giovanni Samaey, Tom Holvoet, Dirk Ro...
CSE
2009
IEEE
13 years 11 months ago
An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing
A user stores his personal files in a cloud, and retrieves them wherever and whenever he wants. For the sake of protecting the user data privacy and the user queries privacy, a use...
Qin Liu, Guojun Wang, Jie Wu
COGSCI
2011
108views more  COGSCI 2011»
13 years 2 months ago
The AHA! Experience: Creativity Through Emergent Binding in Neural Networks
Many kinds of creativity result from combination of mental representations. This paper provides a computational account of how creative thinking can arise from combining neural pa...
Paul Thagard, Terrence C. Stewart