default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunkyu Lee 0001
Person information
- affiliation: IBM Research AI, USA
- affiliation (former): University of California, Irvine, CA, USA
Other persons with the same name
- Junkyu Lee 0002
![[0000-0003-1310-3263]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-1310-3263")
— Sogang University, Seoul, Korea - Junkyu Lee 0003 — Korea University, Seoul, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Fábio Gagliardi Cozman, Radu Marinescu, Junkyu Lee, Alexander G. Gray, Ryan Riegel, Debarun Bhattacharjya:
Markov conditions and factorization in logical credal networks. Int. J. Approx. Reason. 172: 109237 (2024)- [c25]James T. Oswald, Kavitha Srinivas, Harsha Kokel, Junkyu Lee, Michael Katz, Shirin Sohrabi:
Large Language Models as Planning Domain Generators (Student Abstract). AAAI 2024: 23604-23605 - [c24]Brandon Rozek, Junkyu Lee, Harsha Kokel, Michael Katz, Shirin Sohrabi:
Partially Observable Hierarchical Reinforcement Learning with AI Planning (Student Abstract). AAAI 2024: 23635-23636 - [c23]Michael Katz, Junkyu Lee, Shirin Sohrabi:
Unifying and Certifying Top-Quality Planning. ICAPS 2024: 319-323 - [c22]James T. Oswald, Kavitha Srinivas, Harsha Kokel, Junkyu Lee, Michael Katz, Shirin Sohrabi:
Large Language Models as Planning Domain Generators. ICAPS 2024: 423-431 - [c21]Michael Katz, Junkyu Lee, Jungkoo Kang, Shirin Sohrabi:
Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning. SOCS 2024: 213-217 - [i5]Debarun Bhattacharjya, Junkyu Lee, Don Joven Agravante, Balaji Ganesan, Radu Marinescu:
Foundation Model Sherpas: Guiding Foundation Models through Knowledge and Reasoning. CoRR abs/2402.01602 (2024) - [i4]Michael Katz, Junkyu Lee, Shirin Sohrabi:
Unifying and Certifying Top-Quality Planning. CoRR abs/2403.03176 (2024) - [i3]Michael Katz, Junkyu Lee, Jungkoo Kang, Shirin Sohrabi:
Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning. CoRR abs/2404.01503 (2024) - [i2]James T. Oswald, Kavitha Srinivas, Harsha Kokel, Junkyu Lee, Michael Katz, Shirin Sohrabi:
Large Language Models as Planning Domain Generators. CoRR abs/2405.06650 (2024) - 2023
- [c20]Michael Katz, Junkyu Lee:
K∗ Search over Orbit Space for Top-k Planning. IJCAI 2023: 5368-5376 - [c19]Harsha Kokel, Junkyu Lee, Michael Katz, Kavitha Srinivas, Shirin Sohrabi:
Action Space Reduction for Planning Domains. IJCAI 2023: 5394-5401 - [c18]Radu Marinescu, Debarun Bhattacharjya, Junkyu Lee, Fábio Gagliardi Cozman, Alexander G. Gray:
Credal Marginal MAP. NeurIPS 2023 - [c17]Michael Katz, Junkyu Lee, Shirin Sohrabi:
Generating SAS+ Planning Tasks of Specified Causal Structure. SOCS 2023: 29-37 - [c16]Junkyu Lee, Michael Katz, Shirin Sohrabi:
On K* Search for Top-K Planning. SOCS 2023: 38-46 - [c15]Michael Katz, Junkyu Lee:
K∗ and Partial Order Reduction for Top-Quality Planning. SOCS 2023: 143-147 - 2022
- [c14]Harsha Kokel, Junkyu Lee, Michael Katz, Shirin Sohrabi, Kavitha Srinivas:
How to Reduce Action Space for Planning Domains? (Student Abstract). AAAI 2022: 12989-12990 - [i1]Junkyu Lee, Michael Katz, Don Joven Agravante, Miao Liu, Tim Klinger, Murray Campbell, Shirin Sohrabi, Gerald Tesauro:
AI Planning Annotation for Sample Efficient Reinforcement Learning. CoRR abs/2203.00669 (2022) - 2021
- [c13]Junkyu Lee, Radu Marinescu, Rina Dechter:
Submodel Decomposition Bounds for Influence Diagrams. AAAI 2021: 12147-12157 - [c12]Radu Marinescu, Junkyu Lee, Rina Dechter:
A New Bounding Scheme for Influence Diagrams. AAAI 2021: 12158-12165 - 2020
- [b1]Junkyu Lee:
Decomposition Bounds for Influence Diagrams. University of California, Irvine, USA, 2020 - [c11]Junkyu Lee:
Submodel Decomposition for Solving Limited Memory Influence Diagrams (Student Abstract). AAAI 2020: 13851-13852 - [c10]Junkyu Lee, Radu Marinescu, Rina Dechter:
Heuristic AND/OR Search for Solving Influence Diagram. SOCS 2020: 127-128
2010 – 2019
- 2019
- [c9]Junkyu Lee, Radu Marinescu, Alexander Ihler, Rina Dechter:
A Weighted Mini-Bucket Bound for Solving Influence Diagram. UAI 2019: 1159-1168 - 2018
- [j2]Radu Marinescu, Junkyu Lee, Rina Dechter, Alexander Ihler:
AND/OR Search for Marginal MAP. J. Artif. Intell. Res. 63: 875-921 (2018) - [c8]Junkyu Lee, Alexander Ihler, Rina Dechter:
Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall. AAAI Workshops 2018: 674-681 - [c7]Junkyu Lee:
Probabilistic Planning With Influence Diagrams. AAAI 2018: 8018-8019 - [c6]Junkyu Lee, Alexander Ihler, Rina Dechter:
Join Graph Decomposition Bounds for Influence Diagrams. UAI 2018: 1053-1062 - 2017
- [c5]Radu Marinescu, Junkyu Lee, Alexander Ihler, Rina Dechter:
Anytime Best+Depth-First Search for Bounding Marginal MAP. AAAI 2017: 3775-3782 - 2016
- [c4]Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander Ihler:
From Exact to Anytime Solutions for Marginal MAP. AAAI 2016: 3255-3262 - [c3]Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. ISAIM 2016 - 2014
- [c2]Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. StarAI@AAAI 2014
2000 – 2009
- 2006
- [j1]Kwanghoon Kim, Junkyu Lee, Yusung Lee, Joonhyuk Kang, Hyuncheol Park:
High speed transmission for a coaxial cable based in-home network. IEEE Trans. Consumer Electron. 52(2): 430-435 (2006) - [c1]Jaehwan Kim, Junkyu Lee, Joonhyuk Kang:
A Novel Spectrum Sharing Scheme Using Relay Station with Intelligent Reception. KES (3) 2006: 465-472
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-08-05 21:23 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:
