402 search results - page 36 / 81 » Probability, Parallelism and the State Space Exploration Pro... |
CIAC
2000
Springer
14 years 8 days ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
EUROMICRO
2007
IEEE
14 years 2 months ago
2007
IEEE
Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single compon...
AIPS
2004
13 years 9 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
VLSID
2009
IEEE
14 years 8 months ago
2009
IEEE
Many system-level design tasks (e.g. timing analysis, hardware/software partitioning and design space exploration) involve computational kernels that are intractable (usually NP-ha...
IPPS
1998
IEEE
14 years 6 days ago
1998
IEEE
Abstract. We address the problem of developing efficient cache coherence protocols implementing distributed shared memory (DSM) using message passing. A serious drawback of traditi...