4C | Cork Constraint Computation Centre - Conference Items

4C | Cork Constraint Computation Centre - Conference Items

 

Recently added

  • Wilson, Nic; Trabelsi, Walid (Springer Berlin Heidelberg, 2011-09)
    A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g., a CP-net). This involves checking at each ...
  • Trabelsi, Walid; Wilson, Nic; Bridge, Derek G. (Springer Berlin Heidelberg, 2013-11)
    In an era of overwhelming choices, recommender systems aim at recommending the most suitable items to the user. Preference handling is one of the core issues in the design of recommender systems and so it is important for ...
  • Curran, Dara; van der Krogt, Roman; Little, James; Wilson, Nic (Association for the Advancement of Artificial Intelligence, 2013-11)
    Finding the optimal solution for a scheduling problem is hard, both from a computational perspective and because it is frequently difficult to articulate what the user wants. Often there are a range of possible key performance ...
  • O'Mahony, Conor; Wilson, Nic (Springer, 2013)
    Pareto dominance is often used in decision making to compare decisions that have multiple preference values – however it can produce an unmanageably large number of Pareto optimal decisions. When preference value scales ...
  • Marinescu, Radu; Razak, Abdul; Wilson, Nic (Springer, 2013-09)
    In this paper, we consider the extension of multi-objective constraint optimization algorithms to the case where there are additional tradeoffs, reducing the number of optimal solutions. We focus especially on branch-and-bound ...

View more

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