Recently added

CORA: Recently added

  • Prestwich, Steven D.; Freuder, Eugene C.; O'Sullivan, Barry; Browne, David (Springer, 2021-04-17)
    Modeling a combinatorial problem is a hard and error-prone task requiring significant expertise. Constraint acquisition methods attempt to automate this process by learning constraints from examples of solutions and (usually) ...
  • Huang, Hong; Climent, Laura; O'Sullivan, Barry (Institute of Electrical and Electronics Engineers, IEEE, 2017-11)
    Many real-life problems can be formulated as boolean satisfiability (SAT). In addition, in many of these problems, there are some hard clauses that must be satisfied but also some other soft clauses that can remain unsatisfied ...
  • Climent, Laura; Wallace, Richard J.; O'Sullivan, Barry; Freuder, Eugene C. (World Scientific Publishing, 2016-02)
    Data uncertainty in real-life problems is a current challenge in many areas, including Operations Research (OR) and Constraint Programming (CP). This is especially true given the continual and accelerating increase in the ...
  • Prestwich, Steven D.; Fajemisin, Adejuyigbe O.; Climent, Laura; O'Sullivan, Barry (Springer, 2015-09)
    We are working with a company on a hard industrial optimisation problem: a version of the well-known Cutting Stock Problem in which a paper mill must cut rolls of paper following certain cutting patterns to meet customer ...
  • Pagalyte, Elinga; Mancini, Maurizio; Climent, Laura (Association for Computing Machinery, ACM, 2020-10)
    Game flow represents a state where the player is neither frustrated nor bored. In turn-based battle video games it can be achieved by Dynamic Difficulty Adjustment (DDA), whose research has begun rising over the last decade. ...
This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement