Sciweavers

2436 search results - page 15 / 488
» Comonadic Notions of Computation
Sort
View
CEEMAS
2005
Springer
13 years 9 months ago
Palpable Computing and the Role of Agent Technology
This paper presents a computing approach, called Palpable Computing, complementing and extending Ambient Computing notions and techniques. The main contribution of this paper lies ...
Giovanni Rimassa, Dominic A. P. Greenwood, Monique...
CIE
2010
Springer
14 years 8 days ago
On the Completeness of Quantum Computation Models
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
Pablo Arrighi, Gilles Dowek
LOGCOM
2008
103views more  LOGCOM 2008»
13 years 7 months ago
Computable Models
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...
Raymond Turner
EOR
2002
68views more  EOR 2002»
13 years 7 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass