default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJin-Myung Won
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c9]Mohammad Kachuee, Jinseok Nam, Sarthak Ahuja, Jin-Myung Won, Sungjin Lee:
Scalable and Robust Self-Learning for Skill Routing in Large-Scale Conversational AI Systems. NAACL-HLT (Industry Papers) 2022: 1-8- [i1]Mohammad Kachuee, Jinseok Nam, Sarthak Ahuja, Jin-Myung Won, Sungjin Lee:
Scalable and Robust Self-Learning for Skill Routing in Large-Scale Conversational AI Systems. CoRR abs/2204.07135 (2022)
2010 – 2019
- 2014
- [j6]Jin-Myung Won, Fakhri Karray:
Toward Necessity of Parametric Conditions for Monotonic Fuzzy Systems. IEEE Trans. Fuzzy Syst. 22(2): 465-468 (2014) - 2012
- [j5]Jinwook Kim, Jin-Myung Won, Kyungmo Koo, Jin S. Lee:
Monotonic Fuzzy Systems As Universal Approximators For Monotonic Functions. Intell. Autom. Soft Comput. 18(1): 13-31 (2012) - [c8]Jin-Myung Won, Fakhri Karray:
Necessity of parametric conditions for monotonic TSK fuzzy systems. SMC 2012: 2026-2029 - 2011
- [j4]Tarek M. Hamdani
, Jin-Myung Won, Adel M. Alimi, Fakhri Karray:
Hierarchical genetic algorithm with new evaluation function and bi-coded representation for the selection of features considering their confidence rate. Appl. Soft Comput. 11(2): 2501-2509 (2011) - [j3]Jin-Myung Won, Fakhreddine Karray:
A Greedy Algorithm for Faster Feasibility Evaluation of All-Terminal-Reliable Networks. IEEE Trans. Syst. Man Cybern. Part B 41(6): 1600-1611 (2011) - 2010
- [j2]Jin-Myung Won, Fakhri Karray:
Cumulative Update of All-Terminal Reliability for Faster Feasibility Decision. IEEE Trans. Reliab. 59(3): 551-562 (2010)
2000 – 2009
- 2008
- [c7]Sameeh Ullah, Fakhri Karray, Jin-Myung Won:
Non-dominated Sorting Evolution Strategy-based K-means clustering algorithm for accent classification. ICPR 2008: 1-4 - 2007
- [c6]Jin-Myung Won, Fakhreddine Karray:
A Genetic Algorithm with cycle representation and contraction digraph model for Guideway Network design of Personal Rapid Transit. IEEE Congress on Evolutionary Computation 2007: 2405-2412 - [c5]Tarek M. Hamdani, Jin-Myung Won, Adel M. Alimi, Fakhri Karray:
Multi-objective Feature Selection with NSGA II. ICANNGA (1) 2007: 240-247 - 2006
- [c4]Jin-Myung Won, Ki-Moon Lee, Jin S. Lee, Fakhreddine Karray:
Guideway Network Design of Personal Rapid Transit System: A Multiobjective Genetic Algorithm Approach. IEEE Congress on Evolutionary Computation 2006: 2215-2221 - [c3]Jin-Myung Won, Hyojeong Choe, Fakhreddine Karray:
Optimal design of personal rapid transit. ITSC 2006: 1489-1494 - 2002
- [j1]Jin-Myung Won, Sang Y. Park, Jin S. Lee:
Parameter conditions for monotonic Takagi-Sugeno-Kang fuzzy system. Fuzzy Sets Syst. 132(2): 135-146 (2002) - [c2]Nam Geun Kim, Jin-Myung Won, Jin S. Lee, Sang Woo Kim:
Local convergence rate of evolutionary algorithm with combined mutation operator. IEEE Congress on Evolutionary Computation 2002: 261-266 - 2001
- [c1]Jin-Myung Won, Keehong Seo, Seok K. Hwang, Jin S. Lee:
Evolutionary Computation Based Identification of a Monotonic Takagi-Sugeno-Kang Fuzzy System. FUZZ-IEEE 2001: 1140-1143
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-04-25 05:43 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:
