Covering design problem constructed by using the TS-CD algorithm

Abstract—In this paper, we propose an improvement of the attack on the Rank Syndrome Decoding (RSD) problem found in [1], usually the best attack considered for evaluating the

Given some value of a parameter r, the new restart rule assumes that during the r latest iterations, the GA population was at a stationary distribution and all tentative

Keywords: Graph · Bounded diameter minimum spanning tree · Min- imum spanning tree · Asymptotically optimal algorithm · Probabilistic analysis · Performance guarantees · Random

[5] proposed a parallel solution for a variant of the problem under the CGM model using weighted graphs that requires log p rounds and runs in On2 log m/p time.. Recently, Kim

Cheung and Mosca [7] have shown how to compute the decomposition of an abelian group into a direct product of cyclic subgroups in time polynomial in the logarithm of its order on

Dans le cas d’un Blu-ray, le laser utilisé a une longueur d’onde plus petite et la tâche d’airy correspondante sera donc elle aussi plus petite. Il est donc alors possible

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Odijk (1996) proposes the PCG (PESP Cut Generation) algorithm to generate timetables for train operations using a mathematical model consisting of periodic