7452 search results - page 343 / 1491 » A Semantics for Multiprocessor Systems |
149
click to vote
PUK
2003
15 years 8 months ago
2003
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
196
click to vote
WSC
1998
15 years 8 months ago
1998
The use of the World Wide Web and Java-based mobile code provides new opportunities for distributed simulation. First, the infrastructure provided by the Internet eliminates the n...
147
click to vote
ICEC
1994
15 years 8 months ago
1994
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
175
click to vote
FGCS
2006
15 years 6 months ago
2006
The choice of an interconnection network for a parallel computer depends on a large number of performance factors which are very often application dependent. We propose a performa...
177
click to vote
EJC
2008
15 years 5 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...