Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPing Guo 0003
Person information
- affiliation (PhD 2004): Chongqing University, College of Computer Science, China
Other persons with the same name
- Ping Guo — disambiguation page
- Ping Guo 0001 — University of Paderborn, Germany
- Ping Guo 0002
![[0000-0002-7122-1084]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-7122-1084")
— Beijing Normal University, Image Processing Pattern Recognition Laboratory, China (and 1 more) - Ping Guo 0004 — China Agricultural University, College of Water Conservancy and Civil Engineering, Beijing, China (and 1 more)
- Ping Guo 0005 — Dalian University of Technology, School of Mathematical Sciences, Liaoning, China
- Ping Guo 0006 — Shijiazhuang Tiedao University, School of Economics and Management, Shijiazhuang, Hebei, China
- Ping Guo 0007 — City University of Hong Kong, Hong Kong, SAR, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j23]Yanxia Wang, Jingyi Wang, Ping Guo:
Eye-UNet: a UNet-based network with attention mechanism for low-quality human eye image segmentation. Signal Image Video Process. 17(4): 1097-1103 (2023)- [j22]Ping Guo, Bin Guo:
NERS_HEAD: a new hybrid evolutionary algorithm for solving graph coloring problem. Soft Comput. 27(17): 12117-12131 (2023) - [j21]Mingqiang Zhou, Qianqian Zeng, Ping Guo:
SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via s+-index. J. Supercomput. 79(7): 8026-8047 (2023) - 2022
- [j20]Yuying Xu, Ping Guo, Yi Zeng:
An Iterative Neighborhood Local Search Algorithm for Capacitated Centered Clustering Problem. IEEE Access 10: 34497-34510 (2022) - [j19]Ping Guo, Yang Zhang:
ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy. Appl. Intell. 52(2): 1740-1751 (2022) - [j18]Yaoyao Liu, Ping Guo, Yi Zeng:
HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem. Comput. Intell. Neurosci. 2022: 6400318:1-6400318:24 (2022) - [j17]Yaoyao Liu, Ping Guo, Yi Zeng:
MEACCP: A membrane evolutionary algorithm for capacitated clustering problem. Inf. Sci. 591: 319-343 (2022) - [j16]Mingqiang Zhou, Dan Liu, Yanhui Zheng, Qingsheng Zhu, Ping Guo:
A text sentiment classification model using double word embedding methods. Multim. Tools Appl. 81(14): 18993-19012 (2022) - [j15]Ping Guo, Minliang Jiang:
TSMSA: a 2DSPP algorithm with multi-strategy rectangle selection. J. Supercomput. 78(10): 12242-12277 (2022) - [j14]Ping Guo, Yicheng Jiang:
An improved ant-based heuristic approach for solving the longest cycle problem in large-scale complex networks. J. Supercomput. 78(12): 14164-14190 (2022) - 2021
- [j13]Yaochang Xu, Ping Guo:
MEA-CNDP: A Membrane Evolutionary Algorithm for Solving Biobjective Critical Node Detection Problem. Comput. Intell. Neurosci. 2021: 8406864:1-8406864:20 (2021) - [j12]Jiaqi Gu, Ping Guo:
PEAVC: An improved minimum vertex cover solver for massive sparse graphs. Eng. Appl. Artif. Intell. 104: 104344 (2021) - [j11]Changsheng Quan, Ping Guo:
A local search method based on edge age strategy for minimum vertex cover problem in massive graphs. Expert Syst. Appl. 182: 115185 (2021) - 2020
- [j10]Yueguo Luo, Ping Guo, Yun Jiang, Ying Zhang:
Timed Homeostasis Tissue-Like P Systems With Evolutional Symport/Antiport Rules. IEEE Access 8: 131414-131424 (2020) - [j9]Ping Guo, Mengliang Hou, Lian Ye:
MEATSP: A Membrane Evolutionary Algorithm for Solving TSP. IEEE Access 8: 199081-199096 (2020) - 2019
- [j8]Ping Guo, Changsheng Quan, Haizhu Chen:
MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem. IEEE Access 7: 60774-60784 (2019) - [j7]Lian Ye, Jinhang Zheng, Ping Guo, Mario J. Pérez-Jiménez:
Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division. IEEE Access 7: 66055-66067 (2019) - [j6]Ping Guo, Xuekun Wang, Yi Zeng, Haizhu Chen:
MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem. IEEE Access 7: 108360-108370 (2019) - [j5]Yueguo Luo, Ping Guo, Mingzhe Zhang:
A Framework of Ant Colony P System. IEEE Access 7: 157655-157666 (2019) - [j4]Ping Guo, Changsheng Quan, Lian Ye:
UPSimulator: A general P system simulator. Knowl. Based Syst. 170: 20-25 (2019) - [j3]Wenkai Liu, Ping Guo, Lian Ye:
A Low-Delay Lightweight Recurrent Neural Network (LLRNN) for Rotating Machinery Fault Diagnosis. Sensors 19(14): 3109 (2019) - 2012
- [j2]Ping Guo, Zhujin Liu:
An ant system based on moderate search for TSP. Comput. Sci. Inf. Syst. 9(4): 1533-1551 (2012) - 2006
- [j1]Ping Guo, Xin-Ru Wang, Yan-Rong Kang:
Frequent mining of subgraph structures. J. Exp. Theor. Artif. Intell. 18(4): 513-521 (2006)
Conference and Workshop Papers
- 2018
- [c16]Ping Guo, Junqi Xiang:
An Attribute Reduction P System Based on Rough Set Theory. BIC-TA (1) 2018: 198-212 - [c15]Ping Guo, Changsheng Quan, Lian Ye:
A Simulator for Cell-Like P System. BIC-TA (1) 2018: 223-235 - 2017
- [c14]Ping Guo, Mingzhe Zhang, Jing Chen:
A Family of Ant Colony P Systems. BIC-TA 2017: 175-193 - 2016
- [c13]Lian Ye, Ping Guo:
An Immune Algorithm Based on P System for Classification. BIC-TA (1) 2016: 133-141 - [c12]Ping Guo, Wei Xu:
A Family P System of Realizing RSA Algorithm. BIC-TA (1) 2016: 155-167 - 2012
- [c11]Ping Guo, Lin Zhu, Zhujin Liu, Ying He:
An Ant Colony Algorithm for Solving the Sky Luminance Model Parameters. ICICA (LNCS) 2012: 365-372 - [c10]Ping Guo, Zhujin Liu, Lin Zhu:
Improved Strategies of Ant Colony Optimization Algorithms. ICICA (2) 2012: 396-403 - [c9]Ping Guo, Shuai-Shuai Chen, Ying He:
Study on Data Preprocessing for Daylight Climate Data. ICICA (LNCS) 2012: 492-499 - [c8]Ping Guo, Lin Zhu:
Ant colony optimization for continuous domains. ICNC 2012: 758-762 - 2011
- [c7]Ping Guo, Zhujin Liu:
Moderate ant system: An improved algorithm for solving TSP. ICNC 2011: 1190-1196 - 2005
- [c6]Ping Guo, Yang Zhou, Jun Zhuang, Ting Chen, Yan-Rong Kang:
An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free Subtrees Using Canonical Forms. ADMA 2005: 96-107 - [c5]Ping Guo, Li Fan, Lian Ye:
A Method to Eliminate Incompatible Knowledge and Equivalence Knowledge. ICMLC 2005: 285-294 - [c4]Ping Guo, Lian Ye, Li Fan:
The Incompatible Knowledge Elimination in Knowledge-Integration. AIAI 2005: 89-95 - [c3]Ping Guo, Qin Xie:
The Adaptive Web Server Based on Ant Behavior. AIAI 2005: 863-870 - [c2]Ping Guo, Yan-Rong Kang, Zhong-Lin Chen:
Frequent Subgraph Structure Mining. IICAI 2005: 1410-1418 - [c1]Ping Guo, Li Fan, Lian Ye, Zhong-Lin Chen:
Spatial Direction Reasoning Based on the Operations between Lattice Arrays. IICAI 2005: 2832-2842
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 23:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
