default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJin Young Choi 0001
Person information
- affiliation: Digital Communications Infra Division, Samsung Networks, Korea
Other persons with the same name
- Jin Young Choi (aka: Jin-Young Choi) — disambiguation page
- Jin Young Choi 0002
![[0000-0003-3891-5815]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-3891-5815")
— Seoul National University, Automation and Systems Research Institute, Department of Electrical and Computer Engineering, South Korea - Jin Young Choi 0003 — Ajou University, Department of Industrial Engineering, South Korea
- Jin Young Choi 0004 (aka: Jin-Young Choi 0004) — Dong-A University, Department of of Electronics, Busan, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j5]Spyros A. Reveliotis, Elzbieta Roszkowska, Jin Young Choi:
Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies Through Mathematical Programming. IEEE Trans Autom. Sci. Eng. 7(2): 240-248 (2010)
2000 – 2009
- 2007
- [j4]Spyros A. Reveliotis, Elzbieta Roszkowska, Jin Young Choi:
Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems. IEEE Trans. Autom. Control. 52(12): 2345-2350 (2007) - [c6]Spiridon Reveliotis, Elzbieta Roszkowska, Jin Young Choi:
Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies through Mathematical Programming. CASE 2007: 200-206 - [c5]Spyros A. Reveliotis, Elzbieta Roszkowska, Jin Young Choi:
Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems. ICRA 2007: 991-996 - 2006
- [c4]Spyros A. Reveliotis, Jin Young Choi:
Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions. ICATPN 2006: 322-341 - 2005
- [j3]Jin Young Choi, Spyros A. Reveliotis:
Relative value function approximation for the capacitated re-entrant line scheduling problem. IEEE Trans Autom. Sci. Eng. 2(3): 285-299 (2005) - 2004
- [c3]Jin Young Choi, Spyros A. Reveliotis:
Relative value function approximation for the capacitated re-entrant line scheduling problem: an experimental investigation. CDC 2004: 3661-3667 - 2003
- [j2]Spyros A. Reveliotis, Jin Young Choi:
On the Optimality of Randomized Deadlock Avoidance Policies. Discret. Event Dyn. Syst. 13(4): 303-320 (2003) - [j1]Jin Young Choi, Spyros A. Reveliotis:
A generalized stochastic Petri net model for performance analysis and control of capacitated reentrant lines. IEEE Trans. Robotics Autom. 19(3): 474-480 (2003) - 2002
- [c2]Jin Young Choi, Spyros A. Reveliotis:
An Analytical Investigation of the Scheduling Problem for Capacitated Re-Entrant Lines. ICRA 2002: 3193-3198 - 2001
- [c1]Spyros A. Reveliotis, Jin Young Choi:
On the optimality of randomized deadlock avoidance policies. SMC 2001: 1795-1800
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-12-23 20:34 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:
