![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Pengpeng Lin
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c7]Guofeng Qin, Pengpeng Lin, Chengkun Ren, Tao Zhou, Wentao Li:
Three-Dimensional Model Construction of Swallowing. FTC (1) 2023: 533-542
2010 – 2019
- 2019
- [j6]Ruxin Dai, Pengpeng Lin, Jun Zhang:
An EXCMG accelerated multiscale multigrid computation for 3D Poisson equation. Comput. Math. Appl. 77(8): 2051-2060 (2019) - 2017
- [j5]Ge Gao, Yu-Shen Liu, Pengpeng Lin, Meng Wang, Ming Gu, Jun-Hai Yong:
BIMTag: Concept-based automatic semantic annotation of online BIM product resources. Adv. Eng. Informatics 31: 48-61 (2017) - [j4]Pengpeng Lin, Ruxin Dai, Marco A. Contreras, Jun Zhang:
Combining ant colony optimization with 1-opt local search method for solving constrained forest transportation planning problems. Artif. Intell. Res. 6(2): 27-38 (2017) - [j3]Ruxin Dai, Pengpeng Lin, Jun Zhang:
An efficient sixth-order solution for anisotropic Poisson equation with completed Richardson extrapolation and multiscale multigrid method. Comput. Math. Appl. 73(8): 1865-1877 (2017) - 2016
- [j2]Pengpeng Lin
, Marco A. Contreras, Ruxin Dai, Jun Zhang:
A multilevel ACO approach for solving forest transportation planning problems with environmental constraints. Swarm Evol. Comput. 28: 78-87 (2016) - [c6]Pengpeng Lin, Ruxin Dai, Ran An:
Managing forest transportation planning using ant colony optimization method. SEKE 2016: 219-224 - 2015
- [j1]Pengpeng Lin
, Jun Zhang, Marco A. Contreras:
Automatically configuring ACO using multilevel ParamILS to solve transportation planning problems with underlying weighted networks. Swarm Evol. Comput. 20: 48-57 (2015) - 2014
- [c5]Pengpeng Lin, Jun Zhang, Ran An:
Data dimensionality reduction approach to improve feature selection performance using sparsified SVD. IJCNN 2014: 1393-1400 - [c4]Pengpeng Lin, Jun Zhang, Marco A. Contreras:
Applying pareto ant colony optimization to solve bi-objective forest transportation planning problems. IRI 2014: 795-802 - 2012
- [c3]Nirmal Thapa, Pengpeng Lin, Lian Liu, Jie Wang, Jun Zhang:
Constrained Nonnegative Matrix Factorization based Data Distortion Techniques - Study of Data Privacy and Utility. DATA 2012: 51-56 - [c2]Pengpeng Lin, Jun Zhang, Xiwei Wang, Art Shindhelm:
Simultaneous pattern and data hiding in supervised learning. IRI 2012: 385-392
2000 – 2009
- 2009
- [c1]Pengpeng Lin, Huanjing Wang, Taghi M. Khoshgoftaar:
A Novel Hybrid Search Algorithm for Feature Selection. SEKE 2009: 81-86
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-07-25 19:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint