( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers.

, , и . AAAI, стр. 4132-4139. AAAI Press, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Zheng-Zheng Kuang

Xing Zheng

Jiarong Zheng

Zheng Ren-Rong

Shuiying Zheng

 

Другие публикации лиц с тем же именем

Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem., , и . Int. J. Comput. Intell. Syst., 15 (1): 43 (2022)Relaxed Graph Color Bound for the Maximum k-plex Problem., , , и . CoRR, (2023)Geometric batch optimization for packing equal circles in a circle on large scale., , , и . Expert Syst. Appl., (2024)KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem., , и . AAAI, стр. 20735-20742. AAAI Press, (2024)A Novel and Fine-grained Heap Randomization Allocation Strategy for Effectively Alleviating Heap Buffer Overflow Vulnerabilities., , , , , и . ICMAI, стр. 115-122. ACM, (2019)An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems., , , , и . CoRR, (2024)Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale., , , и . CoRR, (2023)BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit., , , , , и . IJCAI, стр. 1901-1907. ijcai.org, (2022)DiverTEAM: An Effective Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems., , , , и . ECAI, том 392 из Frontiers in Artificial Intelligence and Applications, стр. 4108-4115. IOS Press, (2024)Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem., , , , и . AAAI, стр. 12445-12452. AAAI Press, (2021)