( en | de | ru )

 

Disambiguation of "Feng, Haodi"

Author of the publication

copydeleteadd this publication to your clipboard
New Evolutionary Subset: Application to Symbiotic Evolutionary Algorithm for Job-Shop Scheduling Problem.

, , , and . ICNC (1), page 470-475. IEEE Computer Society, (2008)

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. You can also use the button next to the name to display some publications already assigned to the person.

Yühe Feng

Feng Yan

Feng Shi

Feng Qiu

Zhaoyong Feng

 

Other publications of authors with the same name

(g, f)-Factorizations Orthogonal to k Subgraphs.. WG, volume 2204 of Lecture Notes in Computer Science, page 129-139. Springer, (2001)IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads - (Extended Abstract)., , , , and . ISBRA, volume 10330 of Lecture Notes in Computer Science, page 71-83. Springer, (2017)Longest k-tuple Common Sub-Strings., , , , and . BIBM, page 63-66. IEEE, (2022)A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs., , , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 92-101. Springer, (2016)A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling., , , and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 26-35. Springer, (2001)Estimating isoform abundance by Particle Swarm Optimization., and . BIBM, page 161-166. IEEE Computer Society, (2016)Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor., , and . ADMA, volume 4632 of Lecture Notes in Computer Science, page 345-351. Springer, (2007)DLmeta: a deep learning method for metagenomic identification., , , and . BIBM, page 303-308. IEEE, (2022)Some Results on Orthogonal Factorizations.. COCOON, volume 2108 of Lecture Notes in Computer Science, page 414-419. Springer, (2001)A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling., , , and . Int. J. Found. Comput. Sci., 13 (6): 817-827 (2002)