592 search results - page 53 / 119 » Can Component Service-Based Systems Be Proved Correct |
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
As a novel, grand AI challenge, General Game Playing is concerned with the development of systems that understand the rules of unknown games and play these games well without human...
PRDC
2006
IEEE
14 years 1 months ago
2006
IEEE
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
IDEAL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Gaussian processes have been favourably compared to backpropagation neural networks as a tool for regression. We show that a recurrent neural network can implement exact ...
RP
2010
Springer
13 years 5 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
The components of a context-aware system can often become disconnected because of the dynamic environments within which they are deployed. Hoarding context information on the clie...