An Improved Ant Colony Optimization Algorithm Based on Route Optimization and Its Applications in Travelling Salesman Problem. - Yi Zhang 031; Zhi-Li Pei; Jinhui Yang; Yanchun Liang 001 (BIBE, 2007)

Automata for Weak Factor Recognition. - Meng Zhang 006; Yi Zhang 031; Kuo Zhao; Liang Hu 001 (ICYCS, 2008)

On the Structure of Consistent Partitions of Substring Set of a Word. - Meng Zhang 006; Yi Zhang 031; Liang Hu 001; Peichen Xin (FAW, 2009)

A hybrid ACO/PSO algorithm and its applications. - Yi Zhang 031; Meng Zhang 006; Yanchun Liang 001 (Int. J. Model. Identif. Control., 2009)

Analysis the Uncertainties of the Ant Colony Algorithm. - Yi Zhang 031; Meng Zhang 006; Xin-yan Cao (CASoN, 2010)

Matching a Set of Patterns with Wildcards. - Meng Zhang 006; Yi Zhang 031; Jijun Tang (PAAP, 2010)

A faster algorithm for matching a set of patterns with variable length don't cares. - Meng Zhang 006; Yi Zhang 031; Liang Hu 001 (Inf. Process. Lett., 2010)

Pattern matching with wildcards using words of shorter length. - Meng Zhang 006; Yi Zhang 031; Liang Hu 001 (Inf. Process. Lett., 2010)

Weighted Automata for Full-Text Indexing. - Meng Zhang 006; Liang Hu 001; Yi Zhang 031 (Int. J. Found. Comput. Sci., 2011)

Multi-pattern Matching with Wildcards. - Meng Zhang 006; Yi Zhang 031; Jijun Tang; Xiaolong Bai (J. Softw., 2011)

Label-Guided Graph Exploration with Adjustable Ratio of Labels - Meng Zhang 006; Yi Zhang 031; Jijun Tang (CoRR, 2012)

Some practical solutions to the uncertainties of the ant colony optimisation. - Yi Zhang 031; Meng Zhang 006; Xiaoqi Li 003; Yan Lv (Int. J. Comput. Appl. Technol., 2012)

Application with a hybrid ant colony optimisation in motif detecting problem. - Yi Zhang 031; Meng Zhang 006; Zhi-Li Pei (Int. J. Comput. Appl. Technol., 2012)

Label-Guided Graph Exploration with Adjustable Ratio of Labels. - Liang Hu 001; Meng Zhang 006; Yi Zhang 031; Jijun Tang (Int. J. Found. Comput. Sci., 2012)

Compact representations of automata for regular expression matching. - Meng Zhang 006; Yi Zhang 031; Chen Hou (Inf. Process. Lett., 2016)

Ant colonial-based approach for the minimal full trie problem. - Meng Zhang 006; Yi Zhang 031 (Int. J. Bio Inspired Comput., 2017)

Space-Efficient Representations for Glushkov Automata. - Meng Zhang 006; Yi Zhang 031 (Int. J. Found. Comput. Sci., 2018)

Toward Efficient Encrypted Image Retrieval in Cloud Environment. - Zhengbai Huang; Meng Zhang 006; Yi Zhang 031 (IEEE Access, 2019)

Application of hybrid swarming algorithm on flexible job shop scheduling problems. - Yi Zhang 031; Mengdi Sun; Yong Xu (Concurr. Comput. Pract. Exp., 2021)

Dictionary lookup with one genome evolution operation. - Meng Zhang 006; Yi Zhang 031; Yuming Sun (Concurr. Comput. Pract. Exp., 2021)

Rank and select operations on a word. - Meng Zhang 006; Yi Zhang 031 (Inf. Process. Lett., 2021)

Speedup of discrete Fourier transform by efficient modular arithmetic. - Yi Zhang 031; Mengdi Sun; Xin Qi (Concurr. Comput. Pract. Exp., 2022)

Arbitrary-size permutation networks using arbitrary-radix switches. - Meng Zhang 006; Yi Zhang 031 (Theor. Comput. Sci., 2023)

A Hybrid Swarming Algorithm for Adaptive Enhancement of Low-Illumination Images. - Yi Zhang 031; Xinyu Liu; Yang Lv (Symmetry, 2024)