default search action
Vlad Radulescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c13]Vlad Radulescu
, Albert M. K. Cheng
Work-in-Progress: Flexible bus arbitration in mixed criticality systems. EMSOFT 2023: 11-12 - 2022
- [j5]Valentin Poncos
An Integrated Platform for Ground-Motion Mapping, Local to Regional Scale; Examples from SE Europe. Remote. Sens. 14(4): 1046 (2022) - 2021
- [c12]Vlad Radulescu, Stefan Andrei, Albert M. K. Cheng:
Work-in-Progress Abstract: A New Criterion for Job Switching in Semi-Clairvoyant Systems. RTCSA 2021: 198-200 - [c11]Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu:
Designing a New Soft-Hard Task Model for Scheduling Real-Time Systems on a Multiprocessor Platform. SYNASC 2021: 83-90 - 2020
- [c10]Adrian Iftene, Diana Trandabat, Vlad Radulescu:
Eye and Voice Control for an Augmented Reality Cooking Experience. KES 2020: 1469-1478 - [c9]Alexandru-Gabriel Cristea, Lenuta Alboaie, Andrei Panu, Vlad Radulescu:
Offline but still connected with IPFS based communication. KES 2020: 1606-1612
2010 – 2019
- 2019
- [j4]Stefan Andrei, Albert M. K. Cheng
Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm. Math. Comput. Sci. 13(4): 489-515 (2019) - 2018
- [j3]Vlad Radulescu, Stefan Andrei, Albert M. K. Cheng:
Bounding execution resources for the task scheduling problem in cyber-physical systems. SIGBED Rev. 15(4): 20-28 (2018) - 2016
- [j2]Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu, Sharfuddin Alam, Suresh Vadlakonda:
A new scheduling algorithm for non-preemptive independent tasks on a multi-processor platform. SIGBED Rev. 13(2): 24-29 (2016) - [c8]Vlad Radulescu, Stefan Andrei, Albert M. K. Cheng
Resource Bounding for Non-Preemptive Task Scheduling on a Multiprocessor Platform. SYNASC 2016: 157-164 - 2015
- [c7]Stefan Andrei, Albert M. K. Cheng
An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling. SYNASC 2015: 153-159 - 2014
- [c6]Stefan Andrei, Albert M. K. Cheng
An efficient scheduling algorithm of non-preemptive independent tasks for biomedical systems. NEWCAS 2014: 424-427 - [c5]Vlad Radulescu, Stefan Andrei, Albert M. K. Cheng
A Heuristic-Based Approach for Reducing the Power Consumption of Real-Time Embedded Systems. SYNASC 2014: 172-179 - 2012
- [j1]Stefan Andrei, Albert M. K. Cheng
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform. Int. J. Grid Util. Comput. 3(4): 215-223 (2012) - [c4]Stefan Andrei, Albert M. K. Cheng
Toward an Optimal Power-Aware Scheduling Technique. SYNASC 2012: 135-142 - 2011
- [c3]Stefan Andrei, Albert M. K. Cheng
Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm. SYNASC 2011: 93-100 - 2010
- [c2]Stefan Andrei, Albert M. K. Cheng
An Efficient Scheduling Algorithm for the Multiprocessor Platform. SYNASC 2010: 245-252
1990 – 1999
- 1999
- [c1]Henri Luchian, Ben Paechter, Vlad Radulescu, Silvia Luchian:
Two evolutionary approaches to cross-clustering problems. CEC 1999: 870-876
Coauthor Index
aka: Albert M. K. Cheng
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-04-24 22:50 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: