output
20052026
most citedMean-Based Error Measures for Intermittent Demand Forecasting

64 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.AIShow all

6 papers · 1 filter

cs.AI2011★ 1 cited

Conjure Revisited: Towards Automated Constraint Modelling

Ozgur Akgun, Alan M. Frisch, Brahim Hnich +2

Automating the constraint modelling process is one of the key challenges facing the constraints field, and one of the principal obstacles preventing widespread adoption of constrai…

cs.AI2009

The Complexity of Reasoning with Global Constraints

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +1

Constraint propagation is one of the techniques central to the success of constraint programming. To reduce search, fast algorithms associated with each constraint prune the domain…

cs.AI2009★ 42 cited

SLIDE: A Useful Special Case of the CARDPATH Constraint

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2

We study the CardPath constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CardPath where the sli…

cs.AI2009★ 28 cited

The Parameterized Complexity of Global Constraints

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2

We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propaga…

cs.AI2009★ 7 cited

Filtering Algorithms for the Multiset Ordering Constraint

Alan Frisch, Brahim Hnich, Zeynep Kiziltan +2

Constraint programming (CP) has been used with great success to tackle a wide variety of constraint satisfaction problems which are computationally intractable in general. Global c…

cs.AI2009

Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints

Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +2

We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for…