Sciweavers

498 search results - page 3 / 100
» New Constructions for IPP Codes
Sort
View
TIT
2011
125views more  TIT 2011»
13 years 2 months ago
Exact-Repair MDS Code Construction Using Interference Alignment
Abstract—The high repair cost of (n;k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of MDS codes, called Repair MDS codes, that can signific...
Changho Suh, Kannan Ramchandran
IPPS
2009
IEEE
14 years 1 months ago
Dynamic high-level scripting in parallel applications
Parallel applications typically run in batch mode, sometimes after long waits in a scheduler queue. In some situations, it would be desirable to interactively add new functionalit...
Filippo Gioachin, Laxmikant V. Kalé
DCC
2006
IEEE
14 years 6 months ago
New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices
Using Hadamard matrices and mutually orthogonal Latin squares, we construct two new quasi-symmetric designs, with parameters 2 (66, 30, 29) and 2 - (78, 36, 30). These are the fir...
Carl Bracken, Gary McGuire, Harold N. Ward
ARSCOM
2007
76views more  ARSCOM 2007»
13 years 7 months ago
A New Lower Bound for A(17, 6, 6)
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
Yeow Meng Chee
IPPS
2009
IEEE
14 years 1 months ago
New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem
This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems lik...
André Renato Villela da Silva, Luiz Satoru ...