default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyungchul Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Kyungchul Park
, Sungjoon Kim, Jong Hyuk Park, Woo Young Choi:
A Quantized-Weight-Splitting Method of RRAM Arrays for Neuromorphic Applications. IEEE Access 12: 59680-59687 (2024)- [j15]Kyungchul Park, Sungjoon Kim, Min-Hye Oh, Woo Young Choi:
Resting-potential-adjustable soft-reset integrate-and-fire neuron model for highly reliable and energy-efficient hardware-based spiking neural networks. Neurocomputing 590: 127762 (2024) - 2021
- [j14]Min-Woo Kwon, Kyungchul Park, Byung-Gook Park:
Low-Power Adaptive Integrate-and-Fire Neuron Circuit Using Positive Feedback FET Co-Integrated With CMOS. IEEE Access 9: 159925-159932 (2021) - 2020
- [c2]Kyungchul Park, Chanyoung Oh, Youngmin Yi:
BPNet: Branch-pruned Conditional Neural Network for Systematic Time-accuracy Tradeoff. DAC 2020: 1-6
2010 – 2019
- 2019
- [c1]Kyungchul Park, Youngmin Yi:
BPNet: Branch-pruned conditional neural network for systematic time-accuracy tradeoff in DNN inference: work-in-progress. CODES+ISSS 2019: 2:1-2:2 - 2017
- [j13]Kyungchul Park, Kyungsik Lee:
Distribution-robust loss-averse optimization. Optim. Lett. 11(1): 153-163 (2017) - 2016
- [j12]Kyungchul Park, Kyungsik Lee:
Distribution-robust single-period inventory control problem with multiple unreliable suppliers. OR Spectr. 38(4): 949-966 (2016) - 2012
- [j11]Chungmok Lee, Kyungsik Lee, Kyungchul Park, Sungsoo Park:
Technical Note - Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations. Oper. Res. 60(3): 604-610 (2012) - 2011
- [j10]Taehan Lee, Kyungchul Park, Jang Hyun Baek:
Comparison of routing methods in optical multicast WDM ring networks. Photonic Netw. Commun. 22(1): 46-50 (2011)
2000 – 2009
- 2009
- [j9]Jangha Kang, Kyungchul Park, Sungsoo Park:
Optimal multicast route packing. Eur. J. Oper. Res. 196(1): 351-359 (2009) - [j8]Kyungsik Lee, Kyungchul Park, Sungsoo Park:
A compact formulation of the ring loading problem with integer demand splitting. Oper. Res. Lett. 37(2): 111-113 (2009) - 2007
- [j7]Taehan Lee, Kyungchul Park, Jaekyung Yang, Sungsoo Park:
Optimal Multicast Routing and Wavelength Assignment on WDM Ring Networks Without Wavelength Conversion. IEEE Commun. Lett. 11(11): 898-900 (2007) - 2004
- [j6]Jangha Kang, Kyungchul Park, Sungsoo Park:
ATM VP-based network design. Eur. J. Oper. Res. 158(3): 555-569 (2004) - 2002
- [j5]Gue-woong Jeong, Kyungsik Lee, Sungsoo Park, Kyungchul Park:
A branch-and-price algorithm for the Steiner tree packing problem. Comput. Oper. Res. 29(3): 221-241 (2002) - 2000
- [j4]Donghan Kang, Kyungsik Lee, Sungsoo Park, Kyungchul Park, Sang-Baeg Kim:
Design of local networks using USHRs. Telecommun. Syst. 14(1-4): 197-217 (2000)
1990 – 1999
- 1998
- [j3]Kyungsik Lee, Kyungchul Park, Sungsoo Park, Heesang Lee:
Economic spare capacity planning for DCS mesh-restorable networks. Eur. J. Oper. Res. 110(1): 63-75 (1998) - 1997
- [j2]Kyungchul Park, Sungsoo Park:
Lifting Cover Inequalities for the Precedence-constrained Knapsack Problem. Discret. Appl. Math. 72(3): 219-241 (1997) - 1996
- [j1]Kyungsik Lee, Kyungchul Park, Sungsoo Park:
Design of capacitated networks with tree configurations. Telecommun. Syst. 6(1): 1-19 (1996)
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-07 22:16 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:
