default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoung Myoung Ko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Jongwon Kim, Hyeseon Lee, Young Myoung Ko
:
Constrained Density-Based Spatial Clustering of Applications with Noise (DBSCAN) using hyperparameter optimization. Knowl. Based Syst. 303: 112436 (2024)- [j17]Euihwan Lee, Jaehyoung Ju, Eunshin Byon, Young Myoung Ko:
Condition-Based Selective Maintenance Optimization for Large-Scale Systems Consisting of Many Homogeneous Units. IEEE Trans. Reliab. 73(2): 1393-1406 (2024) - 2023
- [j16]Yongkyu Cho, Seung Min Baik, Young Myoung Ko:
Reliability Improvement of Circular k-Out-of-N: G Balanced Systems Through Center of Gravity. IEEE Access 11: 91407-91422 (2023) - [c2]Seung Min Baik, Young Myoung Ko, Eunshin Byon:
Robust Importance Sampling for Stochastic Simulations with Uncertain Parametric Input Model. WSC 2023: 397-408 - [i4]Yongkyu Cho, Seung Min Baik, Young Myoung Ko:
Reliability Improvement of Circular k-out-of-n: G Balanced Systems through Center of Gravity. CoRR abs/2305.06919 (2023) - [i3]Seung Min Baik, Eunshin Byon, Young Myoung Ko:
Distributionally Robust Stratified Sampling for Stochastic Simulations with Multiple Uncertain Input Models. CoRR abs/2306.09020 (2023) - 2022
- [j15]Yongkyu Cho, Young Myoung Ko:
Power- and QoS-Aware Job Assignment With Dynamic Speed Scaling for Cloud Data Center Computing. IEEE Access 10: 38284-38298 (2022) - [j14]Stéphane R. A. Barde, Young Myoung Ko, Hayong Shin:
General EM algorithm for fitting non-monotone hazard functions from truncated and censored observations. Oper. Res. Lett. 50(5): 476-483 (2022) - 2021
- [j13]Qiyun Pan, Young Myoung Ko, Eunshin Byon:
Uncertainty Quantification for Extreme Quantile Estimation With Stochastic Computer Models. IEEE Trans. Reliab. 70(1): 134-145 (2021) - 2020
- [j12]Yongkyu Cho, Young Myoung Ko:
Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates. Ann. Oper. Res. 293(1): 27-55 (2020) - [j11]Stéphane R. A. Barde, Young Myoung Ko, Hayong Shin:
Fitting discrete phase-type distribution from censored and truncated observations with pre-specified hazard sequence. Oper. Res. Lett. 48(3): 233-239 (2020) - [j10]Alfonsus Julanto Endharta, Young Myoung Ko:
Economic Design and Maintenance of a Circular k-Out-of-n: G Balanced System With Load-Sharing Units. IEEE Trans. Reliab. 69(4): 1465-1479 (2020)
2010 – 2019
- 2019
- [j9]Chang Hyup Oh, Min Hee Kim, Byung-In Kim, Young Myoung Ko:
An Efficient Building Evacuation Algorithm in Congested Networks. IEEE Access 7: 169480-169494 (2019) - [i2]Seung Min Baik, Young Myoung Ko:
A QoS-aware workload routing and server speed scaling policy for energy-efficient data centers: a robust queueing theoretic approach. CoRR abs/1912.09870 (2019) - 2018
- [j8]Yongkyu Cho, Young Myoung Ko:
Energy efficiency of data center operating practices: Server clustering, powering on/off, and bang-bang control. Networks 71(2): 107-119 (2018) - [j7]Alfonsus Julanto Endharta, Won Young Yun, Young Myoung Ko:
Reliability evaluation of circular k-out-of-n: G balanced systems through minimal path sets. Reliab. Eng. Syst. Saf. 180: 226-236 (2018) - [i1]Yongkyu Cho, Young Myoung Ko:
Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates. CoRR abs/1811.01611 (2018) - 2017
- [j6]Jamol Pender, Young Myoung Ko:
Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues. INFORMS J. Comput. 29(4): 688-704 (2017) - [j5]Young Myoung Ko, Jamol Pender:
Diffusion limits for the (MAPt/Pht/∞)N queueing network. Oper. Res. Lett. 45(3): 248-253 (2017) - 2015
- [j4]Young Myoung Ko:
A Simple Analysis of the Transient Period in Peer-to-Peer Networks. IEEE Commun. Lett. 19(9): 1528-1531 (2015) - [j3]Young Myoung Ko, Eunshin Byon:
Reliability Evaluation of Large-Scale Systems With Identical Units. IEEE Trans. Reliab. 64(1): 420-434 (2015) - 2014
- [j2]Young Myoung Ko, Yongkyu Cho:
A distributed speed scaling and load balancing algorithm for energy efficient data centers. Perform. Evaluation 79: 120-133 (2014) - 2013
- [j1]Young Myoung Ko, Natarajan Gautam:
Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations. INFORMS J. Comput. 25(2): 285-301 (2013)
2000 – 2009
- 2007
- [c1]Young Myoung Ko, Jean-François Chamberland, Natarajan Gautam:
Optimal policies for control of peers in online multimedia services. CDC 2007: 3800-3805
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-09-21 23:37 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:
