#### Filter Results:

- Full text PDF available (51)

#### Publication Year

2000

2018

- This year (3)
- Last 5 years (23)
- Last 10 years (39)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Eoin Oâ€™Mahony, Emmanuel Hebrard, A. Holland, Conor Nugent, Barry Oâ€™Sullivan
- 2008

It has been shown in areas such as satisfiability testing and integer linear programming that a carefully chosen combination of solvers can outperform the best individual solver for a given set ofâ€¦ (More)

- Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh
- Constraints
- 2005

The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We show that computing even theâ€¦ (More)

- Emmanuel Hebrard, Brahim Hnich, Barry O'Sullivan, Toby Walsh
- AAAI
- 2005

It is useful in a wide range of situations to find solutions which are diverse (or similar) to each other. We therefore define a number of different classes of diversity and similarity problems. Forâ€¦ (More)

- Emmanuel Hebrard
- IJCAR Doctoral Programme
- 2004

Where changes to a solution introduce additional expenses or reorganization, solution robustness is a valuable property. A robust solution is less sensitive to changes. For example, a robust scheduleâ€¦ (More)

- Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Toby Walsh
- AAAI
- 2004

We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the same tools ofâ€¦ (More)

We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variabl es. We show that SLIDE, a special case of C ARDPATH where the slid constraint mustâ€¦ (More)

- Hadrien Cambazard, Emmanuel Hebrard, Barry O'Sullivan, Alexandre Papadopoulos
- Annals OR
- 2012

We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques,â€¦ (More)

- Emmanuel Hebrard, Brahim Hnich, Toby Walsh
- ECAI
- 2004

Super solutions are solutions in which, if a small number of variables lose their values, we are guaranteed to be able to repair the solution with only a few changes. In this paper, we stress theâ€¦ (More)

- Emmanuel Hebrard
- 2007

We develop a framework for finding robust solutions of constraint programs. Our approach is based on the notion of fault tolerance. We formalise this concept within constraint programming, extend itâ€¦ (More)

Constraint propagation is one of the techniques central to t he success of constraint programming. Fast algorithms are used to prune the search space either before or during backtracking search.â€¦ (More)