1720 search results - page 44 / 344 » Unranking Combinations in Parallel |
TC
2008
13 years 9 months ago
2008
As the scale of high-performance computing (HPC) continues to grow, failure resilience of parallel applications becomes crucial. In this paper, we present FT-Pro, an adaptive fault...
DATE
2009
IEEE
14 years 4 months ago
2009
IEEE
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
ICMCS
2007
IEEE
14 years 4 months ago
2007
IEEE
We present a new class of parallel and distributed audio concealment (PDAC) algorithms which recover lost audio packets at the receiver to fight against channel impairment. The m...
ICPADS
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
ICCS
2003
Springer
14 years 3 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...