1143 search results - page 212 / 229 » Mental models of recursion |
NOMS
1998
IEEE
13 years 12 months ago
1998
IEEE
Network Management Forum (NMF) has defined a set of basic business processes dealing with major TMN service management functions such as performance management, fault management, b...
CIE
2010
Springer
13 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
BPSC
2007
13 years 9 months ago
2007
Originally XML was used as a standard protocol for data exchange in computing. The evolution of information technology has opened up new situations in which XML can be used to aut...
JOC
2000
13 years 7 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...