Global domain views for expressive and cross-domain constraint programming

Autor: Charles Prud'homme, Dimitri Justeau-Allaire

Publikováno v: Constraints

The concept of domain views is a powerful abstraction in constraint programming. It permits to define variables that do not declare any domain but instead rely on a variable x and a function f, such that y=f(x) where y is the view. In addition to mak

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bac14455cbb67fa133028a3c3551aa42
https://doi.org/10.1007/s10601-021-09324-7

Efficient Methods to Search for Best Differential Characteristics on SKINNY

Autor: Charles Prud'homme, Paul Huynh, Victor Mollimard, Stéphanie Delaune, Patrick Derbez, Marine Minier

Publikováno v: Proceedings of the 19th International Conference on Applied Cryptography and Network Security
ACNS 2021-19th International Conference on Applied Cryptography and Network Security
ACNS 2021-19th International Conference on Applied Cryptography and Network Security, Jun 2021, Kamakura, Japan. pp.184-207, ⟨10.1007/978-3-030-78375-4_8⟩
Applied Cryptography and Network Security ISBN: 9783030783747
ACNS (2)
19th International Conference on Applied Cryptography and Network Security
19th International Conference on Applied Cryptography and Network Security, Jun 2021, Kamakura, Japan. pp.184--207

International audience; Evaluating resistance of ciphers against differential cryptanalysis is essential to define the number of rounds of new designs and to mount attacks derived from differential cryptanalysis. In this paper, we propose automatic t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9815edff11d76a8fdbb183836e122c5
https://hal.science/hal-03040548v2/file/report-HAL-v2.pdf

Service Placement in Fog Computing Using Constraint Programming

Autor: Farah Ait Salaht, Charles Prud'homme, Adrien Lebre, Frédéric Desprez, Mohamed Abderrahim

Publikováno v: SCC
SCC 2019 : IEEE International Conference on Services Computing
SCC 2019 : IEEE International Conference on Services Computing, Jul 2019, Milan, Italy. pp.19-27, ⟨10.1109/SCC.2019.00017⟩

This paper investigates whether the use of Constraint Programming (CP) could enable the development of a generic and easy-to-upgrade placement service for Fog Computing. Our contribution is a new formulation of the placement problem, an implementatio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88d2bddd44ed64605248d5ed55376ade
https://doi.org/10.1109/scc.2019.00017

CoMe4ACloud: An End-to-End Framework for Autonomic Cloud Systems

Autor: Charles Prud'homme, Zakarea Alshara, Frederico Alvares, Jonathan Lejeune, Hugo Bruneliere, Thomas Ledoux

Publikováno v: Future Generation Computer Systems
Future Generation Computer Systems, 2018, 86, pp.339-354. ⟨10.1016/j.future.2018.03.039⟩
Future Generation Computer Systems, Elsevier, 2018, 86, pp.339-354. ⟨10.1016/j.future.2018.03.039⟩

International audience; Autonomic Computing has largely contributed to the development of self-manageable Cloud services. It notably allows freeing Cloud administrators of the burden of manually managing varying-demand services, while still enforcing

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f87a8fbd09ba2882c11a3a1fd0581ec3
https://hal.science/hal-01762716/file/FGCS2018_CoMe4ACloud_AuthorsVersion.pdf

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