default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShan Ding
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j4]Jie Liu, Shan Ding:
BI in simulation analysis with gaming for decision making and development of knowledge management. Entertain. Comput. 52: 100811 (2025)- 2021
- [i1]Ping Zhang, Zhenxiang Tao, Wenjie Yang, Minze Chen, Shan Ding, Xiaodong Liu, Rui Yang, Hui Zhang:
Unveiling personnel movement in a larger indoor area with a non-overlapping multi-camera system. CoRR abs/2104.04662 (2021)
2010 – 2019
- 2019
- [c13]Shan Ding, Hui Wang, Gang Zeng:
An Integrated Framework for Packing CAN-FD Frames and Assigning Offsets. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2019: 66-73 - 2018
- [c12]Shan Ding, Tong Zhao, Ryo Kurachi, Gang Zeng:
ID Hopping CAN Controller Design with Obfuscated Priority Assignment. DASC/PiCom/DataCom/CyberSciTech 2018: 94-99 - 2017
- [j3]Shan Ding, Gang Zeng, Ryo Kurachi, Ruifeng Huang:
A Genetic Algorithm for Packing CAN FD Frame with Real-Time Constraints. IEICE Trans. Inf. Syst. 100-D(10): 2505-2514 (2017) - [c11]Shan Ding, Linwei Xin:
An improved algorithm based on convolution dynamic multi-parameter template for microaneurysms detection. CISP-BMEI 2017: 1-6 - [c10]Shan Ding, Jinhui Wu, Guoqi Xie, Gang Zeng:
A Hybrid Heuristic-Genetic Algorithm with Adaptive Parameters for Static Task Scheduling in Heterogeneous Computing System. TrustCom/BigDataSE/ICESS 2017: 761-766 - 2016
- [c9]Shan Ding, Ruifeng Huang, Ryo Kurachi, Gang Zeng:
A Genetic Algorithm for Minimizing Bandwidth Utilization by Packing CAN-FD Frame. ICESS 2016: 119-124 - 2014
- [c8]Shan Ding, Wenyi Ma:
An Accurate Approach for Microaneurysm Detection in Digital Fundus Images. ICPR 2014: 1846-1851 - [c7]Shan Ding, Ya-nan Zhao:
Connectivity of cycles constrained Root-LDPC codes for block fading channels. WCNC 2014: 194-199 - 2012
- [c6]Shan Ding, Shiya Lui, Yuanyuan Li:
Shared-Cache Simulation for Multi-core System with LRU2-MRU Collaborative Cache Replacement Algorithm. SNPD 2012: 127-131 - 2010
- [c5]Shan Ding:
Scheduling Approach for Static Segment using Hybrid Genetic Algorithm in FlexRay Systems. CIT 2010: 2355-2360
2000 – 2009
- 2009
- [j2]Shan Ding, Hiroyuki Tomiyama, Hiroaki Takada:
Effective Scheduling Algorithms for I/O Blocking with a Multi-Frame Task Model. IEICE Trans. Inf. Syst. 92-D(7): 1412-1420 (2009) - 2008
- [j1]Shan Ding, Hiroyuki Tomiyama, Hiroaki Takada:
An Effective GA-Based Scheduling Algorithm for FlexRay Systems. IEICE Trans. Inf. Syst. 91-D(8): 2115-2123 (2008) - [c4]Shan Ding, Zhiqiang Xie, Xiaona Yin:
A GA-based Systematic Message Scheduling Method for Time-Triggered CAN. EUC (2) 2008: 455-460 - 2007
- [c3]Shan Ding, Hiroyuki Tomiyama, Hiroaki Takada:
Scheduling Algorithms for I/O Blockings with a Multi-frame Task Model. RTCSA 2007: 386-393 - 2005
- [c2]Shan Ding, Naohiko Murakami, Hiroyuki Tomiyama, Hiroaki Takada:
A GA-based scheduling method for FlexRay systems. EMSOFT 2005: 110-113 - 2002
- [c1]Shan Ding, Naohiro Ishii:
Feature Weights Determining of Pattern Classification by Using a Rough Genetic Algorithm with Fuzzy Similarity Measure. IDEAL 2002: 544-550
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-08-03 21:19 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:
