Additive, Structural and Multiplicative Transformations for the Construction of Quasi-Cyclic LDPC matrices

Autor: Audrey Cerqueus, Emmanuel Boutillon, Alban Derrien

Publikováno v: IEEE Transactions on Communications
IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 2019, 67 (4), pp.2647-2659. ⟨10.1109/TCOMM.2018.2890251⟩
IEEE Transactions on Communications, 2019, 67 (4), pp.2647-2659. ⟨10.1109/TCOMM.2018.2890251⟩

International audience; The construction of a Quasi-Cyclic Low Density Parity-Check (QC-LDPC) matrix is usually carried out in two steps. In the first step, a prototype matrix is defined according to certain criteria (size, girth, check and variable

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ea7e9eb1c18f0645ee6ace9f1e131e0
https://hal.archives-ouvertes.fr/hal-01950474

Range-Consistent Forbidden Regions of Allen’s Relations

Autor: Mats Carlsson, Nicolas Beldiceanu, Peter J. Stuckey, Andreas Schutt, Alban Derrien, Charles Prud'homme

Publikováno v: LNCS
CPAIOR 2017 : 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming
CPAIOR 2017 : 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, Jun 2017, Padoue, Italy. pp.21-29, ⟨10.1007/978-3-319-59776-8_2⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Integration of AI and OR Techniques in Constraint Programming
Lecture Notes in Computer Science (LNCS)
Integration of AI and OR Techniques in Constraint Programming ISBN: 9783319597751
CPAIOR

For all 8192 combinations of Allen’s 13 relations between one task with origin \(o_i\) and fixed length \(\ell _i\) and another task with origin \(o_j\) and fixed length \(\ell _j\), this paper shows how to systematically derive a formula \(F(\unde

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a1d7e20be162c90bf92b4ae80e76e57
https://hal.archives-ouvertes.fr/hal-01686406

A New Characterization of Relevant Intervals for Energetic Reasoning

Autor: Alban Derrien, Thierry Petit

Publikováno v: Principles and Practice of Constraint Programming
Principles and Practice of Constraint Programming, Sep 2014, Lyon, France. pp.289-297, ⟨10.1007/978-3-319-10428-7_22⟩
Lecture Notes in Computer Science ISBN: 9783319104270
CP

International audience; Energetic Reasoning (ER) is a powerful filtering algorithm for the Cumulative constraint. Unfortunately, ER is generally too costly to be used in practice. One reason of its bad behavior is that many intervals are considered a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1968c39c5c9e254580ef3784f285916d
https://hal.science/hal-01084436/document