29082 search results - page 222 / 5817 » The Time-Triggered Model of Computation |
164
click to vote
ICGA
2006
15 years 6 months ago
2006
In this note, the psychology of aesthetics is briefly discussed and the feasibility of a discrete computational aesthetics model for chess isjustified.
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this work we start walking the path to a new perspective for viewing cyberwarfare scenarios, by introducing conceptual tools (a formal model) to evaluate the costs of an attack...
144
click to vote
CATA
2003
15 years 8 months ago
2003
The imprecise computation model provides the ability to cope with unpredictable workloads. However, there is no consistent way on how to terminate the computation in its early sta...
171
click to vote
APAL
1998
15 years 6 months ago
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
146
click to vote
MFCS
1989
Springer
15 years 10 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...