 | 2011 |
|---|
| 12 |       | Assef Chmeiss,
Jean-François Condotta:
Consistency of Triangulated Temporal Qualitative Constraint Networks.
ICTAI 2011: 799-802 |
| 2008 |
|---|
| 11 | | Assef Chmeiss,
Vincent Krawczyk,
Lakhdar Sais:
Redundancy in CSPs.
ECAI 2008: 907-908 |
| 2007 |
|---|
| 10 | | Assef Chmeiss,
Vincent Krawczyk,
Lakhdar Sais:
Light Integration of Path Consistency for Solving CSPs.
ICTAI (1) 2007: 263-266 |
| 2004 |
|---|
| 9 | | Assef Chmeiss,
Lakhdar Sais:
Constraint Satisfaction Problems: Backtrack Search Revisited.
ICTAI 2004: 252-257 |
| 2003 |
|---|
| 8 |  | Assef Chmeiss,
Philippe Jégou,
Lamia Keddar:
On a generalization of triangulated graphs for domains decomposition of CSPs.
IJCAI 2003: 203-208 |
| 2001 |
|---|
| 7 | | Christian Bessière,
Assef Chmeiss,
Lakhdar Sais:
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem.
CP 2001: 565-569 |
| 2000 |
|---|
| 6 | | Assef Chmeiss,
Lakhdar Sais:
About the use of local consistency in solving CSPs.
ICTAI 2000: 104-107 |
| 1998 |
|---|
| 5 | | Assef Chmeiss,
Philippe Jégou:
Efficient Path-Consistency Propagation.
International Journal on Artificial Intelligence Tools 7(2): 121-142 (1998) |
| 1997 |
|---|
| 4 | | Assef Chmeiss,
Philippe Jégou:
A Generalization of Chordal Graphs and the Maximum Clique Problem.
Inf. Process. Lett. 62(2): 61-66 (1997) |
| 1996 |
|---|
| 3 | | Assef Chmeiss,
Philippe Jégou:
Path-Consistency: When Space Misses Time.
AAAI/IAAI, Vol. 1 1996: 196-201 |
| 2 | | Assef Chmeiss,
Philippe Jégou:
Efficient Constraint Propagation With Good Space Complexity.
CP 1996: 533-534 |
| 1 | | Assef Chmeiss,
Philippe Jégou:
Two New Donstraint Propagation Algorithms Requiring Small Space Complexity.
ICTAI 1996: 286-289 |
Data released under the ODC-BY 1.0 license — See also our legal information page