Seguir
Erli WANG
Erli WANG
NEC Labs, China
Dirección de correo verificada de nec.cn - Página principal
Título
Citado por
Citado por
Año
Cemab: A cross-entropy-based method for large-scale multi-armed bandits
E Wang, H Kurniawati, DP Kroese
Artificial Life and Computational Intelligence: Third Australasian …, 2017
152017
An on-line planner for pomdps with large discrete action space: A quantile-based approach
E Wang, H Kurniawati, D Kroese
Proceedings of the international conference on automated planning and …, 2018
132018
Inventory Control with Partially Observable States
E Wang, H Kurniawati, DP Kroese
42019
Ishikawa’s Iterative Algorithm of Nonexpansive Mappings and Averaged Mappings
D Qibin, W Erli, W Dingping, X Xuping
Proceedings of the 2012 International Conference on Communication …, 2013
32013
The Split Feasibility Problem in Hilbert Space
W Dingping, D Qibin, W Erli, Z Hang
Proceedings of the 2012 International Conference on Communication …, 2013
12013
ACAMDA: Improving Data Efficiency in Reinforcement Learning Through Guided Counterfactual Data Augmentation
Y Sun, E Wang, B Huang, C Lu, L Feng, C Sun, K Zhang
2024
ACAMDA: Improving Data Efficiency in Reinforcement Learning Through Guided Counterfactual Data Augmentation
Y Sun, E Wang, B Huang, C Lu, L Feng, C Sun, K Zhang
Proceedings of the AAAI Conference on Artificial Intelligence, 15193-15201, 2024
2024
Decision making in an uncertain world
E Wang
2019
A Certain Asymptotically Strict Pseudocontractive Mappings in the Intermediate Sense Semigroup
W Erli, D Qibin, W Dingping, Z Hang
Proceedings of the 2012 International Conference on Communication …, 2013
2013
基于最优点的新强化缓冲算子及其性质研究
王尔立， 陈勇明， 陈治西
统计与决策, 14-16, 2012
2012
基于序列势态和系统比重的 TRA 灰色关联度算法
陈治西， 陈勇明， 王尔立
成都信息工程学院学报 27 (4), 385-389, 2012
2012
Strong Convergence Theorems for Lipschitzian Demi-contraction Semi-group in Banach Space
W Erli, W Dingping, D Qibin, Z Hang
2011 International Conference on Business Computing and Global …, 2011
2011
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–12