674 search results - page 29 / 135 » The computational complexity of the parallel knock-out probl... |
185
click to vote
FCCM
2006
IEEE
16 years 14 hour ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
149
click to vote
IPPS
2009
IEEE
16 years 18 days ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
152
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
185
click to vote
WDAG
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
157
click to vote
IMR
2007
Springer
16 years 3 days ago
2007
Springer
Unstructured hexahedral mesh generation is a critical part of the modeling process in the Spectral-Element Method (SEM). We present some examples of seismic wave propagation in co...