Zhe Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zhe Li has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Yang Shi
National university of defense technology, Changsha, China
2 shared publications - Yaohua Wang
National university of defense technology, Changsha, China
2 shared publications - Zhanshan Li
College of Computer Science and Technology, Jilin University, Changchun, China
2 shared publications Jianan Chen
Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry, Changchun, China
1 shared publication- Jianjun Chen
National University of Defense Technology
1 shared publication Mingqi Yang
Jilin University
1 shared publication
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Accelerating AI+SAR Applications through Enhanced Graph Optimization
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessAccelerating AI+SAR Applications through Enhanced Graph Optimization
- Open Access
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 70-74
CVS: A Metric for Security-Aware Compilation against Side-Channel Attacks in Edge SoCs (WIP)
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 70-74
Open AccessCVS: A Metric for Security-Aware Compilation against Side-Channel Attacks in Edge SoCs (WIP)
- Open Access
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 167823-167835
A Novel Multi-Thread Parallel Constraint Propagation Scheme
Constraint Programming (CP) is an efficient technique for solving combinatorial (optimization) problems. In modern constraint solver, a CP Model is defined over reversible variables that take values in domains and propagators which filter the domains of the variables. Constraint propagation scheme schedules the propagators. A reasonable constraint propagation algorithm can improve the efficiency of solving CP problems. In this paper, we propose two efficient parallel propagation schemes based on multi-thread technique for table constraint. First, we give the formal definition of the parallel consistency and prove that the parallel propagation scheme is equivalent to the classic serial propagation scheme. Then, we propose two parallel propagation schemes: static submission and dynamic submission, which exploit work stealing thread pool and atomic operations to parallelize the classic propagation of table constraint. Finally, extensive experiments on various types of problems show that the two parallel schemes outperform their original serial version on a large number of instances. The results demonstrate the competitiveness of parallel propagation algorithms on solving extensional constraints.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 167823-167835
Open AccessA Novel Multi-Thread Parallel Constraint Propagation Scheme
Constraint Programming (CP) is an efficient technique for solving combinatorial (optimization) problems. In modern constraint solver, a CP Model is defined over reversible variables that take values in domains and propagators which filter the domains of the variables. Constraint propagation scheme schedules the propagators. A reasonable constraint propagation algorithm can improve the efficiency of solving CP problems. In this paper, we propose two efficient parallel propagation schemes based on multi-thread technique for table constraint. First, we give the formal definition of the parallel consistency and prove that the parallel propagation scheme is equivalent to the classic serial propagation scheme. Then, we propose two parallel propagation schemes: static submission and dynamic submission, which exploit work stealing thread pool and atomic operations to parallelize the classic propagation of table constraint. Finally, extensive experiments on various types of problems show that the two parallel schemes outperform their original serial version on a large number of instances. The results demonstrate the competitiveness of parallel propagation algorithms on solving extensional constraints.
- 11 August 2018
- Published by Springer Nature
- p. 59-68
A New Variable-Oriented Propagation Scheme for Constraint Satisfaction Problem
- 11 August 2018
- Published by Springer Nature
- p. 59-68
A New Variable-Oriented Propagation Scheme for Constraint Satisfaction Problem