Have a personal or library account? Click to login
Solving Sat in a Distributed Cloud: A Portfolio Approach Cover

Solving Sat in a Distributed Cloud: A Portfolio Approach

International Journal of Applied Mathematics and Computer Science
Volume 29 (2019): Issue 2 (June 2019)
By: Yanik Ngoko,  Christophe Cérin and  Denis Trystram  
Open Access
|Jul 2019

Authors

Yanik Ngoko

yanik.ngoko@qarnot-computing.com

Department of Research and Development, Montrouge, France
Department of Computer Science, University of Paris 13, Villetaneuse, France

Christophe Cérin

christophe.cerin@lipn.univ-paris13.fr

Department of Computer Science, University of Paris 13, Villetaneuse, France

Denis Trystram

denis.trystram@imag.fr

Department of Computer Science, University of Grenoble Alpes, d’Héres cedex, France
DOI: https://doi.org/10.2478/amcs-2019-0019 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 261 - 274
Submitted on: Jul 26, 2018
Accepted on: Mar 2, 2019
Published on: Jul 4, 2019
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
resource provisioning and scheduling,
parallel distributed SAT,
algorithm portfolio,
maximum coverage problem
Related subjects:
Mathematics,
Applied mathematics

© 2019 Yanik Ngoko, Christophe Cérin, Denis Trystram, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 29 (2019): Issue 2 (June 2019)Next article