Assef Chmeiss - Associate professor
Kontaktdaten
- 03 21 79 32 76
- chmeiss@cril.univ-artois.fr
- http://www.cril.univ-artois.fr/~chmeiss
https://orcid.org/0000-0002-5557-5149- idHalassef-chmeiss
-
- iut
IUT de Lens
Rue de l'Université SP 16
62307 Lens Cedex
France
Forschungsachsen
- Constraints
Publications
International journals
1998 Assef Chmeiss, Ph. Jégou, Efficient Path-Consistency Propagation in Intl. Journ. for Artificial Intelligence Tools,vol. 7, n° 2, pp. 121-142, 1998.
1997 Assef Chmeiss, Ph. Jégou, A Generalization of Chordal Graphs and the Maximum Clique Problem in Information Processing Letters,vol. 62, pp. 61-66, 1997.
International conferences
2011 Assef Chmeiss, Jean-Francois Condotta, Consistency of triangulated temporal qualitative constraint networks in 23rd International Conference on Tools with Artificial Intelligence (ICTAI'11),IEEE Computer Press, pp. 199-802, 2011.
2008 Assef Chmeiss, Vincent Krawczyk, Lakhdar Saïs, Redundancy in {CSPs} in 18th European Conference on Artificial Intelligence (ECAI'08),pp. 907-908, 2008.
2008 Assef Chmeiss, Vincent Krawczyk, Lakhdar Saïs, Redundancy in CSPs in 18th European Conference on Artificial Intelligence(ECAI'08),pp. 907-908, 2008.
2006 Assef Chmeiss, Lakhdar Saïs, About look-ahead algorithms in Constraint Satisfaction Problems in 2nd IEEE International Conference on Information Technologies: from Theory to Applications (ICTTA'06),vol. 2, pp. 3492 - 3497, 2006.
2004 Assef Chmeiss, Lakhdar Saïs, Constraint Satisfaction Problems : Backtrack Search Revisited in Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04),pp. 252-257, 2004.
2003 Assef Chmeiss, Ph. Jégou, L Keddar, On a generalization of triangulated graphs for domains decomposition of CSPs in IJCAI'03,2003.
2003 Assef Chmeiss, Lakhdar Saïs, About Neighborhood Substitutability in CSPs in Proceedings of the Third International Workshop on Symmetry in Constraint Satisfaction problems (SymCon'2003),pp. 41-45, 2003.
2001 Christian Bessiere, Assef Chmeiss, Lakhdar Saïs, Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem in 7th International Conference on Principles and Practice of Constraint Programming (CP 2001),vol. 2239, pp. 565-569, 2001.
2000 Assef Chmeiss, Lakhdar Saïs, About the use of local consistency in solving CSPs in Proc. of the Twelfth IEEE Intl. Conf. on Tools with Artificial Intelligence - ICTAI'00,IEEE Computer Press, pp. 104-107, 2000.
1996 Assef Chmeiss, Ph. Jégou, Efficient Constraint Propagation With Good Space Complexity in Proc. Second Int. Conf. on Principles and Practice of Constrant Programming,Springer, pp. 233-234, 1996.
1996 Assef Chmeiss, Ph. Jégou, Path-Consistency : When Space Misses Time in Proc. 13th National Conference on Artificial Intelligence (AAAI-96),pp. 196-201, 1996.
1996 Belaid Benhamou, Assef Chmeiss, Some heuristics to improve forward checking search methods in CSP's in Proc. of the 7th Int. Conf. on Artificial Intelligence : Methodology, Systems and Applications (AIMSA-96),pp. 285-292, 1996.
1996 Assef Chmeiss, Ph. Jégou, Two New Constraint Propagation Algorithms Requiring Small Space Complexity in Proc. of the 8th Int. Conf. on Tools with Artificial Intelligence (IEEE-ICTAI-96),IEEE Computer Society Press, pp. 286-289, 1996.
1995 Belaid Benhamou, Assef Chmeiss, Improvements and heuristics for forward checking search methods in CSP's in Proc. CP-Workshop on Studying and Solving Really Hard Problems,pp. 194, 1995.
National conferences
2008 Assef Chmeiss, Vincent Krawczyk, Lakhdar Saïs, La redondance dans les CSPs in JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes,pp. 173-179, 2008.
2008 Assef Chmeiss, Vincent Krawczyk, Lakhdar Saïs, Intégration partielle de la consistance de chemin dans la résolution des CSP in JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes,pp. 385-389, 2008.
2005 Assef Chmeiss, Lakhdar Saïs, De FC a MAC : un Algorithme Paramétrable pour la Résolution de CSP in Premières Journées Francophones de la Programmation par Contraintes (JFPC'05),pp. 267-276, 2005.
2003 Assef Chmeiss, Ph. Jégou, L Keddar, Sur une généralisation des graphes triangulaires et son application à la décomposition de domaines dans les CSP in JNPC'03,2003.
2001 Christian Bessiere, Assef Chmeiss, Lakhdar Saïs, Heuristiques multi-niveaux pour ordonner les variables dans les CSP in Actes des 7ème journées Nationales sur la résolution Pratique des problèmes NP-Complets (JNPC'2001),pp. 49-60, 2001.
1998 Assef Chmeiss, Ph. Jégou, Décomposition : vers une érosion du pic de difficulté ? in Actes des Quatrième Journ. Nat. sur la Résolution Pratique de Problèmes NP-Complets (JNPC-98),pp. 21-29, 1998.
1996 Belaid Benhamou, Assef Chmeiss, Dealing with forward checking search method in CSP's in Actes de la deuxième Conférence Nationale sur la Résolution Pratique des Problèmes NP-complets (CNCP-96),Teknéa Editions, pp. 249-257, 1996.
1996 Assef Chmeiss, Sur la consistance de chemin et ses formes partielles in Actes du Congrès AFCET-RFIA-96,pp. 212-219, 1996.