Showing results 1 to 4 of 4
Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems Hasan, Mohammad Khairul; Chwa, Kyung-Yong, JOURNAL OF COMPUTER AND SYSTEM SCIENCES, v.82, no.6, pp.1044 - 1063, 2016-09 |
Constrained bayesian reinforcement learning via approximate linear programming = 근사 선형계획법을 이용한 제약을 갖는 베이지안 강화학습link Lee, Jongmin; Kim, Kee-Eung; et al, 한국과학기술원, 2017 |
Inverse Constraint Learning and Generalization by Transferable Reward Decomposition Jang, Jaehwi; Song, Minjae; Park, Daehyung, IEEE ROBOTICS AND AUTOMATION LETTERS, v.9, no.1, pp.279 - 286, 2024-01 |
Non-Exhaustive, Overlapping Clustering Whang, Joyce Jiyoung; Hou, Yangyang; Gleich, David F.; Dhillon, Inderjit S., IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, v.41, no.11, pp.2644 - 2659, 2019-11 |
Discover