Kyungchul Park

Orcid: 0000-0001-6742-8894

According to our database1, Kyungchul Park authored at least 18 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Resting-potential-adjustable soft-reset integrate-and-fire neuron model for highly reliable and energy-efficient hardware-based spiking neural networks.
Neurocomputing, 2024

A Quantized-Weight-Splitting Method of RRAM Arrays for Neuromorphic Applications.
IEEE Access, 2024

2021
Low-Power Adaptive Integrate-and-Fire Neuron Circuit Using Positive Feedback FET Co-Integrated With CMOS.
IEEE Access, 2021

2020
BPNet: Branch-pruned Conditional Neural Network for Systematic Time-accuracy Tradeoff.
Proceedings of the 57th ACM/IEEE Design Automation Conference, 2020

2019
BPNet: Branch-pruned conditional neural network for systematic time-accuracy tradeoff in DNN inference: work-in-progress.
Proceedings of the International Conference on Hardware/Software Codesign and System Synthesis Companion, 2019

2017
Distribution-robust loss-averse optimization.
Optim. Lett., 2017

2016
Distribution-robust single-period inventory control problem with multiple unreliable suppliers.
OR Spectr., 2016

2012
Technical Note - Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations.
Oper. Res., 2012

2011
Comparison of routing methods in optical multicast WDM ring networks.
Photonic Netw. Commun., 2011

2009
A compact formulation of the ring loading problem with integer demand splitting.
Oper. Res. Lett., 2009

Optimal multicast route packing.
Eur. J. Oper. Res., 2009

2007
Optimal Multicast Routing and Wavelength Assignment on WDM Ring Networks Without Wavelength Conversion.
IEEE Commun. Lett., 2007

2004
ATM VP-based network design.
Eur. J. Oper. Res., 2004

2002
A branch-and-price algorithm for the Steiner tree packing problem.
Comput. Oper. Res., 2002

2000
Design of local networks using USHRs.
Telecommun. Syst., 2000

1998
Economic spare capacity planning for DCS mesh-restorable networks.
Eur. J. Oper. Res., 1998

1997
Lifting Cover Inequalities for the Precedence-constrained Knapsack Problem.
Discret. Appl. Math., 1997

1996
Design of capacitated networks with tree configurations.
Telecommun. Syst., 1996


  Loading...