4586 search results - page 339 / 918 » Computing stable models in parallel |
117
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
We consider several natural broadcasting problems for the LogP model of distributed memory machines recently proposed by Culler et al. For each of these problems, we present algor...
128
click to vote
DEBS
2007
ACM
15 years 8 months ago
2007
ACM
In this paper, we present BoP, a content-based publish/subscribe system for arbitrary Boolean subscriptions and advertisements. BoP targets at the time and space-efficient matchin...
143
Voted
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
158
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
136
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...