default search action
Ran Bi 0001
Person information
- affiliation: Northeastern University, Qinhuangdao, China
- affiliation: Dalian University of Technology, Dalian, China
Other persons with the same name
- Ran Bi — disambiguation page
- Ran Bi 0002
— China Academy of Space Technology, Institute of Telecommunication and Navigation Satellites, Beijing, China
- Ran Bi 0003
- Ran Bi 0004
- Ran Bi 0005 — Zhejiang University, College of Optical Science and Engineering, Hangzhou, China
- Ran Bi 0006 — University of Electronic Science and Technology of China, Chengdu, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Feng Li
VPSS: A DAG scheduling heuristic with improved response time bound. J. Syst. Archit. 148: 103084 (2024) - [c19]Ran Bi, Weiye Si, Jiankang Ren, Xiaolin Fang, Yiwei Sun, Bingguo Chen:
Dynamic Computation Scheduling for Hybrid Energy Mobile Edge Computing Networks. APWeb/WAIM (4) 2024: 359-376 - 2023
- [j12]Jiankang Ren
Protection Window Based Security-Aware Scheduling against Schedule-Based Attacks. ACM Trans. Embed. Comput. Syst. 22(5s): 103:1-103:22 (2023) - 2022
- [j11]Ran Bi
Utility-Oriented Computation Scheduling for Energy-Efficient Mobile Edge Computing Networks. IEEE Open J. Comput. Soc. 3: 260-270 (2022) - [j10]Xiaolin Fang, Hu Fan, Ming Yang, Tongxin Zhu, Ran Bi
Small object detection in remote sensing images based on super-resolution. Pattern Recognit. Lett. 153: 107-112 (2022) - [j9]Shuangshuang Chang
Toward Minimum WCRT Bound for DAG Tasks Under Prioritized List Scheduling Algorithms. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41(11): 3874-3885 (2022) - [c18]Ran Bi
Efficient maximum data age analysis for cause-effect chains in automotive systems. DAC 2022: 1243-1248 - [c17]Ran Bi
Joint Service Placement and Computation Scheduling in Edge Clouds. ICWS 2022: 47-56 - [c16]Jiankang Ren, Huawei Lv, Ran Bi
Energy-Efficient Deep Neural Network Optimization via Pooling-Based Input Masking. IJCNN 2022: 1-8 - [c15]Ran Bi
Response Time Analysis for Prioritized DAG Task with Mutually Exclusive Vertices. RTSS 2022: 460-473 - 2021
- [j8]Yao Yao
Bacterial Foraging Algorithm Based on Activity of Bacteria for DNA Computing Sequence Design. IEEE Access 9: 2110-2124 (2021) - [j7]Xiaolin Fang, Weiwei Wu, Ran Bi
A system to monitor one's nearsightedness implicitly. CCF Trans. Pervasive Comput. Interact. 3(3): 223-234 (2021) - 2020
- [j6]Xiaolin Fang, Zhipeng Cai
Job Scheduling to Minimize Total Completion Time on Multiple Edge Servers. IEEE Trans. Netw. Sci. Eng. 7(4): 2245-2255 (2020) - [c14]Xiaolin Fang, Weiwei Wu, Ran Bi
A System to Find the Change of One's Vision Implicitly. GPC 2020: 318-332
2010 – 2019
- 2019
- [j5]Jiankang Ren, Yong Xie, Ran Bi, Yifan He, Guowei Wu, Guozhen Tan:
Workload-aware harmonic partitioned scheduling for fixed-priority probabilistic real-time tasks on multiprocessors. J. Syst. Archit. 93: 20-32 (2019) - [c13]Xiuyuan Yang, Liang Yang, Ran Bi, Hongfei Lin:
A Comprehensive Verification of Transformer in Text Classification. CCL 2019: 207-218 - [c12]Xiuyuan Yang, Ran Bi
Budget-Aware Equilibrium Offloading for Mobile Edge Computing. SmartIoT 2019: 383-387 - [c11]Ran Bi
Model Based Adaptive Data Acquisition for Internet of Things. WASA 2019: 16-28 - [c10]Ran Bi
Utility Aware Task Offloading for Mobile Edge Computing. WASA 2019: 547-555 - 2018
- [j4]Ran Bi
Accuracy-aware data collection in wireless sensor networks. Int. J. Sens. Networks 28(3): 149-164 (2018) - [c9]Jiankang Ren, Ran Bi
Workload-aware harmonic partitioned scheduling for probabilistic real-time systems. DATE 2018: 213-218 - 2017
- [c8]Ran Bi
Utility-Driven Approximate Task Allocation for Crowdsourcing. BigCom 2017: 23-30 - [c7]Ran Bi
Detection quality aware deployment scheme with heterogeneous sensors. HAVE 2017: 1-6 - [c6]Ran Bi, Guozhen Tan, Xiaolin Fang:
Critical Value Aware Data Acquisition Strategy in Wireless Sensor Networks. ICPCSEE (2) 2017: 148-160 - 2016
- [j3]Ran Bi
(α, τ) -Monitoring for event detection in wireless sensor networks. J. Comb. Optim. 32(4): 985-1001 (2016) - [j2]Ran Bi
Optimizing Retransmission Threshold in Wireless Sensor Networks. Sensors 16(5): 665 (2016) - [c5]Ran Bi
Optimal Assignment for Deadline Aware Tasks in the Crowdsourcing. BDCloud-SocialCom-SustainCom 2016: 178-184 - [c4]Ran Bi
Adaptive Filter Based Strategy for Data Collection in Wireless Sensor Networks. BDCloud-SocialCom-SustainCom 2016: 317-324 - 2015
- [j1]Ran Bi
Deadline Aware Retransmission Threshold Setting Protocol in Cyber-Physical Systems. Int. J. Distributed Sens. Networks 11: 271259:1-271259:11 (2015) - 2014
- [c3]Ran Bi, Jianzhong Li, Hong Gao:
Sampling Based Approximate \tau τ -Quantile Computation Algorithm in Sensor Networks. CWSN 2014: 509-519 - [c2]Ran Bi, Hong Gao, Quan Chen:
Maximizing Probability of Data Packet Delivery within Deadline. WASA 2014: 215-224 - [c1]Ran Bi, Hong Gao, Yingshu Li:
Probabilistic Threshold Based Monitoring Using Sensor Networks. WASA 2014: 246-255
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-10-31 20:10 CET 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: