Examinando por Autor "Monfroy, E."

Mostrando 1 - 2 de 2
  • Miniatura
    ÍtemAcceso Abierto
    Set constraint model and automated encoding into SAT: application to the social golfer problem
    (Springer New York LLC, 2015) Lardeux, F.; Monfroy, E.; Crawford, B.; Soto, R.
    On the one hand, constraint satisfaction problems allow one to expressively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to expressively model set constraint problems and to encode them automatically into SAT instances. We apply our technique to the social golfer problem and we also use it to break symmetries of the problem. Our technique is simpler, more expressive, and less error-prone than direct modeling. The SAT instances that we automatically generate contain less clauses than improved direct instances such as in Triska and Musliu (Ann Oper Res 194(1):427–438, 2012), and with unit propagation they also contain less variables. Moreover, they are well-suited for SAT solvers and they are solved faster as shown when solving difficult instances of the social golfer problem. © 2015, Springer Science+Business Media New York.
  • Miniatura
    ÍtemAcceso Abierto
    Towards a framework for adaptive constraint propagation
    (Springer Verlag, 2015) Crawford, B.; Soto, R.; Johnson, F.; Monfroy, E.; Norero, E.; Olguín, E.
    In this paper we address a recent situation created by the explosive growth of web systems. For these reason we propose a framework to support adaptive elements in Web pages. Web pages can be accessed by different platforms with different browsers and through different devices such as laptops, tablets or cellphones. In particular we focus on adaptive menus for this different kind of devices or browsers to optimize the selection patterns and their implementations. We propose a framework using an Adaptive Constraint Programming technique to optimize the decision of developers. Constraint Programming is a programming paradigm able to find efficient resolution in optimization problems. In Constraint Programming a problem is defined in term of variables and constraints. The variables hold a domain and represent the unknowns of the problem, while the relations among them are modeled as constraints. © Springer International Publishing Switzerland 2015.