Professor of Computer Science
National Laboratory of Software Development Environment
Department of Computer Science and Engineering
Beijing University of Aeronautics and Astronautics
Beijing, 100083, P. R. China.

Email (Always the BEST way to contact me):
(Replace (AT) by @ if you want to send me an email)

Research Interests

Selected Papers

Ke Xu, Frederic Boussemart, Fred Hemery and Christophe Lecoutre.
Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances. (ps) (ps.gz) (pdf)
Artificial Intelligence, 171(2007):514-534.
Earlier version appeared in Proc. of 19th IJCAI, pp.337-342, Scotland, 2005.

Ke Xu and Wei Li.
Many Hard Examples in Exact Phase Transitions. (ps) (ps.gz) (pdf)
Theoretical Computer Science, 355(2006):291-302.
Earlier version appeared as CoRR Report cs.CC/0302001 in Feb. 2003.

Qingguo Zheng, Ke Xu and Shilong Ma.
When to Update the Sequential Patterns of Stream Data? (pdf)
Proc. 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD),
Korea, LNAI 2637, pages 545-550, 2003.

Shilong Ma, Yuefei Sui and Ke Xu.
The Limits of Horn Logic Programs. (ps) (ps.gz) (pdf)
Proc. 18th International Conference on Logic Programming (ICLP),
Denmark, LNCS 2401, short paper, page 467, 2002.

Ke Xu and Wei Li.
Exact Phase Transitions in Random Constraint Satisfaction Problems. (ps) (ps.gz) (pdf)
Journal of Artificial Intelligence Research, 12(2000):93-103.

More selected papers and selected technical reports ...

Benchmarks Based on Model RB

Forced Satisfiable CSP and SAT Benchmarks of Model RB

Benchmarks with Hidden Optimum Solutions for Independent Set, Vertex Cover, Clique and Vertex Coloring

Pseudo-Boolean (0-1 Integer Programming) Benchmarks with Hidden Optimum Solutions

Benchmarks with Hidden Optimum Solutions for Set Covering, Set Packing and Winner Determination

Weighted Max-2-SAT Benchmarks with Hidden Optimum Solutions

A Game of Numbers Based on Model RB

A Java Game of CSP Based on Model RB

©2009 Ke Xu