29046 search results - page 192 / 5810 » Computable Models |
134
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
110
click to vote
WSC
2004
15 years 4 months ago
2004
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
121
Voted
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
We introduce a simple and practical method for repairing inconsistent databases. Given a possibly inconsistent database, the idea is to properly represent the underlying problem, i...
145
Voted
EUROCRYPT
2008
Springer
15 years 5 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
109
click to vote
ICMAS
2000
15 years 4 months ago
2000
In this paper, I motivate, define, and illustrate the notion of computationally grounded theories of agency. A theory of agency is said to be computationally grounded if we can gi...