A novel and fine-grained heap randomization allocation strategy for effectively alleviating heap buffer overflow vulnerabilities Z Jin, Y Chen, T Liu, K Li, Z Wang, J Zheng Proceedings of the 2019 4th International Conference on Mathematics and …, 2019 | 4 | 2019 |
A reinforced hybrid genetic algorithm for the traveling salesman problem J Zheng, J Zhong, M Chen, K He Computers & Operations Research 157, 106249, 2023 | 18 | 2023 |
A simulated annealing approach for the circle bin packing problem with rectangular items K Tole, R Moqa, J Zheng, K He Computers & Industrial Engineering 176, 109004, 2023 | 12 | 2023 |
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem J Zhou, K He, J Zheng, CM Li, Y Liu Proceedings of the International Joint Conference on Artificial Intelligence …, 2022 | 6 | 2022 |
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum -Bundle Problem J Xue, J Zheng, M Jin, K He arXiv preprint arXiv:2402.03736, 2024 | | 2024 |
An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem J Zheng, Y Hong, W Xu, W Li, Y Chen Computers & Operations Research 143, 105772, 2022 | 24 | 2022 |
An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem Y Wang, J Xie, J Zheng, K He arXiv preprint arXiv:2201.10049, 2022 | | 2022 |
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems J Zheng, J Xue, K He, CM Li, Y Liu arXiv preprint arXiv:2404.09997, 2024 | | 2024 |
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit J Zheng, K He, J Zhou, Y Jin, C Li, F Manya Proceedings of the International Joint Conference on Artificial Intelligence …, 2022 | 17 | 2022 |
Combining BandMaxSAT and FPS with NuWLS-c J Zheng, K He, M Jin, Z Chen, J Xue MaxSAT Evaluation 2023, 25, 0 | | |
Combining hybrid walking strategy with kissat mab, cadical, and lstech-maple J Zheng, K He, Z Chen, J Zhou, CM Li SAT COMPETITION 2022, 20, 2022 | 6 | 2022 |
Combining reinforcement learning with Lin-Kernighan-Helsgaun algorithm for the traveling salesman problem J Zheng, K He, J Zhou, Y Jin, CM Li Proceedings of the AAAI conference on artificial intelligence 35 (14), 12445 …, 2021 | 66 | 2021 |
Composite clustering normal distribution transform algorithm T Liu, J Zheng, Z Wang, Z Huang, Y Chen International Journal of Advanced Robotic Systems 17 (3), 1729881420912142, 2020 | 6 | 2020 |
Decision tree based hybrid walking strategies J Zheng, K He, Z Chen, J Zhou, CM Li MaxSAT Evaluation 2022, 24, 2022 | 3 | 2022 |
Effective variable depth local search for the budgeted maximum coverage problem J Zhou, J Zheng, K He International Journal of Computational Intelligence Systems 15 (1), 43, 2022 | 4 | 2022 |
Efficient Approaches for the Single Cylindrical Packing Problem with Cylindrical Items R Moqa, J Zheng, K He Available at SSRN 4401347, 2023 | | 2023 |
Farsighted probabilistic sampling based local search for (weighted) partial maxsat J Zheng, J Zhou, K He arXiv preprint arXiv:2108.09988, 2021 | 10 | 2021 |
Farsighted probabilistic sampling: a general strategy for boosting local search MaxSAT solvers J Zheng, K He, J Zhou Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 4132-4139, 2023 | 2 | 2023 |
Farsighted Probabilistic Sampling: A General Strategy for Boosting MaxSAT Local Search Solvers J Zheng, J Zhou, K He arXiv preprint arXiv:2108.09988, 2021 | | 2021 |
FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem Y Wang, J Zheng, J Xie, K He arXiv preprint arXiv:2405.03176, 2024 | | 2024 |