3247 search results - page 559 / 650 » Randomized smoothing networks |
128
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
143
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
136
click to vote
HCW
1998
IEEE
15 years 8 months ago
1998
IEEE
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
143
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper, the effect of switch design on the application performance of cache-coherent non-uniform memory access (CC-NUMA) multiprocessors is studied in detail. Wormhole rout...
142
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...