2479 search results - page 265 / 496 » A Computational Theory of Working Memory |
183
click to vote
GECCO
2005
Springer
16 years 5 days ago
2005
Springer
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...
198
Voted
PEWASUN
2004
ACM
16 years 2 days ago
2004
ACM
An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, ...
164
click to vote
FOSSACS
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
163
click to vote
SEMWEB
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We show that the Semantic Web needs a formal semantics for the various kinds of links between ontologies and other documents. We provide a model theoretic semantics that ...
163
click to vote
FM
2003
Springer
15 years 12 months ago
2003
Springer
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...