1805 search results - page 218 / 361 » A Theory of Closure Operators |
160
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
190
click to vote
CAEPIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In recent years, particle filters have emerged as a useful tool that enables the application of Bayesian reasoning to problems requiring dynamic state estimation. The ef...
158
click to vote
FM
2003
Springer
15 years 11 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 ...
163
click to vote
ICADL
2003
Springer
15 years 11 months ago
2003
Springer
Building a shared and widely accessible repository, in order for scientists and end users to exploit it easily, results in tackling a variety of issues. Among others, the need for ...
180
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...