|
Search the dblp DataBase
Assef Chmeiss:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Assef Chmeiss, Philippe Jégou
Path-Consistency: When Space Misses Time. [Citation Graph (0, 0)][DBLP] AAAI/IAAI, Vol. 1, 1996, pp:196-201 [Conf]
- Christian Bessière, Assef Chmeiss, Lakhdar Sais
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP] CP, 2001, pp:565-569 [Conf]
- Assef Chmeiss, Philippe Jégou
Efficient Constraint Propagation With Good Space Complexity. [Citation Graph (0, 0)][DBLP] CP, 1996, pp:533-534 [Conf]
- Assef Chmeiss, Philippe Jégou
Two New Donstraint Propagation Algorithms Requiring Small Space Complexity. [Citation Graph (0, 0)][DBLP] ICTAI, 1996, pp:286-289 [Conf]
- Assef Chmeiss, Lakhdar Sais
About the use of local consistency in solving CSPs. [Citation Graph (0, 0)][DBLP] ICTAI, 2000, pp:104-107 [Conf]
- Assef Chmeiss, Lakhdar Sais
Constraint Satisfaction Problems: Backtrack Search Revisited. [Citation Graph (0, 0)][DBLP] ICTAI, 2004, pp:252-257 [Conf]
- Assef Chmeiss, Philippe Jégou, Lamia Keddar
On a generalization of triangulated graphs for domains decomposition of CSPs. [Citation Graph (0, 0)][DBLP] IJCAI, 2003, pp:203-208 [Conf]
- Assef Chmeiss, Philippe Jégou
Efficient Path-Consistency Propagation. [Citation Graph (0, 0)][DBLP] International Journal on Artificial Intelligence Tools, 1998, v:7, n:2, pp:121-142 [Journal]
- Assef Chmeiss, Philippe Jégou
A Generalization of Chordal Graphs and the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:62, n:2, pp:61-66 [Journal]
Redundancy in CSPs. [Citation Graph (, )][DBLP]
Light Integration of Path Consistency for Solving CSPs. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|