default search action
Liangjun Ke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Xiaoqiang Wang, Liangjun Ke, Gewei Zhang, Dapeng Zhu:
Adaptive mean field multi-agent reinforcement learning. Inf. Sci. 669: 120560 (2024) - [c22]Yue Yang, Liangjun Ke:
Exploiting Degradation Prior for Personalized Federated Learning in Real-World Image Super-Resolution. ICMR 2024: 146-154 - [c21]Yuanhui Hao, Chubing Guo, Liangjun Ke:
Multi-UAV Collaborative Detection Based on Reinforcement Learning. ICSI (1) 2024: 463-474 - 2023
- [j25]Zhimin Qiao, Liangjun Ke, Xiaoqiang Wang:
Traffic signal control using a cooperative EWMA-based multi-agent reinforcement learning. Appl. Intell. 53(4): 4483-4498 (2023) - [c20]Laicai Xie, Wanpeng Ma, Liping Wang, Liangjun Ke:
A New Deep Reinforcement Learning Algorithm for UAV Swarm Confrontation Game. DMBD (1) 2023: 199-210 - 2022
- [j24]Xiaoqiang Wang, Liangjun Ke, Qiang Fu:
Attentional Factorized Q-Learning for Many-Agent Learning. IEEE Access 10: 108775-108784 (2022) - [c19]Yanxue Xiong, Zhigang Wang, Liangjun Ke:
A Deep Reinforcement Learning Approach for Cooperative Target Defense. DMBD (1) 2022: 17-26 - [c18]Jianyu Duan, Yanxiao Guo, Zhigang Wang, Liangjun Ke:
Particle Swarm Based Reinforcement Learning. DMBD (1) 2022: 27-36 - 2021
- [j23]Zhimin Qiao, Liangjun Ke, Gewei Zhang, Xiaoqiang Wang:
Adaptive collaborative optimization of traffic network signal timing based on immune-fireworks algorithm and hierarchical strategy. Appl. Intell. 51(10): 6951-6967 (2021) - [j22]Xiaoqiang Wang, Liangjun Ke, Zhimin Qiao, Xinghua Chai:
Large-Scale Traffic Signal Control Using a Novel Multiagent Reinforcement Learning. IEEE Trans. Cybern. 51(1): 174-187 (2021) - [c17]Xiaoqiang Wang, Yali Du, Shengyu Zhu, Liangjun Ke, Zhitang Chen, Jianye Hao, Jun Wang:
Ordering-Based Causal Discovery with Reinforcement Learning. IJCAI 2021: 3566-3573 - [i3]Xiaoqiang Wang, Yali Du, Shengyu Zhu, Liangjun Ke, Zhitang Chen, Jianye Hao, Jun Wang:
Ordering-Based Causal Discovery with Reinforcement Learning. CoRR abs/2105.06631 (2021) - 2020
- [j21]Ke Shang, Felix T. S. Chan, Stephen Karungaru, Kenji Terada, Zuren Feng, Liangjun Ke:
Two-Stage Robust Optimization for the Orienteering Problem with Stochastic Weights. Complex. 2020: 5649821:1-5649821:15 (2020) - [j20]Dongbin Jiao, Peng Yang, Liqun Fu, Liangjun Ke, Ke Tang:
Optimal Energy-Delay Scheduling for Energy-Harvesting WSNs With Interference Channel via Negatively Correlated Search. IEEE Internet Things J. 7(3): 1690-1703 (2020) - [c16]Gewei Zhang, Zihong Gao, Junbo Huo, Liangjun Ke:
Point Cloud Registration Using Evolutionary Algorithm. BIC-TA 2020: 69-77
2010 – 2019
- 2019
- [j19]Weibo Yang, Liangjun Ke:
An improved fireworks algorithm for the capacitated vehicle routing problem. Frontiers Comput. Sci. 13(3): 552-564 (2019) - [j18]Dongbin Jiao, Liangjun Ke, Shengbo Liu, Felix T. S. Chan:
Optimal Energy-Delay in Energy Harvesting Wireless Sensor Networks with Interference Channels. Sensors 19(4): 785 (2019) - [c15]Zhimin Qiao, Liangjun Ke, Xiaoqiang Wang, Xin Lu:
Signal Control of Urban Traffic Network Based on Multi-Agent Architecture and Fireworks Algorithm. CEC 2019: 2199-2206 - [c14]Dongbin Jiao, Peng Yang, Liqun Fu, Liangjun Ke, Ke Tang:
Optimal Energy-Delay Scheduling for Energy Harvesting WSNs via Negatively Correlated Search. ICC 2019: 1-7 - [i2]Xiaoqiang Wang, Liangjun Ke, Zhimin Qiao, Xinghua Chai:
Large-scale Traffic Signal Control Using a Novel Multi-Agent Reinforcement Learning. CoRR abs/1908.03761 (2019) - 2018
- [j17]Tianjiao Zhang, Liangjun Ke, Jing Li, Jisheng Li, Jingqi Huang, Zexi Li:
Metaheuristics for the tabu clustered traveling salesman problem. Comput. Oper. Res. 89: 1-12 (2018) - [j16]Liangjun Ke:
A brain storm optimization approach for the cumulative capacitated vehicle routing problem. Memetic Comput. 10(4): 411-421 (2018) - [i1]Dongbin Jiao, Liangjun Ke, Shengbo Liu, Felix T. S. Chan:
Optimal Energy-Delay in Energy Harvesting Wireless Sensor Networks with Interference Channel. CoRR abs/1810.11218 (2018) - 2017
- [j15]Jing Li, Liangjun Ke, Gangqiang Ye, Tianjiao Zhang:
Ant colony optimisation for the routing problem in the constellation network with node satellite constraint. Int. J. Bio Inspired Comput. 10(4): 267-274 (2017) - [j14]Dongbin Jiao, Liangjun Ke, Weibo Yang, Jing Li:
An Estimation of Distribution Algorithm Based Dynamic Clustering Approach for Wireless Sensor Networks. Wirel. Pers. Commun. 97(3): 4697-4727 (2017) - [c13]Dongbin Jiao, Liangjun Ke, Weibo Yang, Jing Li:
An Estimation of Distribution Algorithm Based Load-Balanced Clustering of Wireless Sensor Networks. CSE/EUC (1) 2017: 151-158 - [c12]Liangjun Ke, Weibo Yang:
Reformulation and Metaheuristic for the Team Orienteering Arc Routing Problem. ICSI (2) 2017: 494-501 - 2016
- [j13]Ke Shang, Zuren Feng, Liangjun Ke, Felix T. S. Chan:
Comprehensive Pareto Efficiency in robust counterpart optimization. Comput. Chem. Eng. 94: 75-91 (2016) - [c11]Hui Ding, Liangjun Ke, Zihao Geng:
Route planning in a new tourist recommender system: A fireworks algorithm based approach. CEC 2016: 4022-4028 - [c10]Tianjiao Zhang, Liangjun Ke, Jisheng Li, Jing Li, Zexi Li, Jingqi Huang:
Fireworks algorithm for the satellite link scheduling problem in the navigation constellation. CEC 2016: 4029-4037 - [c9]Zhenbao Liu, Zuren Feng, Liangjun Ke:
A Modified Fireworks Algorithm for the Multi-resource Range Scheduling Problem. ICSI (1) 2016: 535-543 - 2015
- [c8]Zhenbao Liu, Zuren Feng, Liangjun Ke:
Fireworks algorithm for the multi-satellite control resource scheduling problem. CEC 2015: 1280-1286 - [c7]Ke Shang, Liangjun Ke, Zuren Feng, Stephen Karungaru:
An Event-Driven Based Multiple Scenario Approach for Dynamic and Uncertain UAV Mission Planning. ICSI (2) 2015: 308-316 - 2014
- [j12]Liangjun Ke, Qingfu Zhang, Roberto Battiti:
Hybridization of Decomposition and Local Search for Multiobjective Optimization. IEEE Trans. Cybern. 44(10): 1808-1820 (2014) - [c6]Liangjun Ke, Huimin Guo, Qingfu Zhang:
A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows. IEEE Congress on Evolutionary Computation 2014: 1878-1882 - [c5]Liangjun Ke, Laipeng Zhai:
A Multiobjective Large Neighborhood Search for a Vehicle Routing Problem. ICSI (2) 2014: 301-308 - [c4]Ke Shang, Stephen Karungaru, Zuren Feng, Liangjun Ke, Kenji Terada:
A GA-ACO hybrid algorithm for the multi-UAV mission planning problem. ISCIT 2014: 243-248 - 2013
- [j11]Liangjun Ke, Zuren Feng:
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 40(2): 633-638 (2013) - [j10]Liangjun Ke, Zongben Xu, Zuren Feng, Ke Shang, Xueming Qian:
Proportion-based robust optimization and team orienteering problem with interval data. Eur. J. Oper. Res. 226(1): 19-31 (2013) - [j9]Liangjun Ke, Qingfu Zhang, Roberto Battiti:
MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColony. IEEE Trans. Cybern. 43(6): 1845-1859 (2013) - 2011
- [j8]Kailiang Xu, Zuren Feng, Liangjun Ke:
Single machine scheduling with total tardiness criterion and convex controllable processing times. Ann. Oper. Res. 186(1): 383-391 (2011) - [j7]Na Zhang, Zuren Feng, Liangjun Ke:
Guidance-solution based ant colony optimization for satellite control resource scheduling problem. Appl. Intell. 35(3): 436-444 (2011) - [j6]Xueming Qian, Xian-Sheng Hua, Ping Chen, Liangjun Ke:
PLBP: An effective local binary patterns texture descriptor with pyramid representation. Pattern Recognit. 44(10-11): 2502-2515 (2011) - 2010
- [j5]Kailiang Xu, Zuren Feng, Liangjun Ke:
A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates. Ann. Oper. Res. 181(1): 303-324 (2010) - [j4]Zhi-Gang Ren, Zu-ren Feng, Liangjun Ke, Zhao-Jun Zhang:
New ideas for applying ant colony optimization to the set covering problem. Comput. Ind. Eng. 58(4): 774-784 (2010) - [j3]Liangjun Ke, Zuren Feng, Zhigang Ren, Xiaoliang Wei:
An ant colony optimization approach for the multidimensional knapsack problem. J. Heuristics 16(1): 65-83 (2010) - [c3]Na Zhang, Zuren Feng, Liangjun Ke:
New pheromone trail updating method of ACO for satellite control resource scheduling problem. IEEE Congress on Evolutionary Computation 2010: 1-6
2000 – 2009
- 2009
- [c2]Qingsong Song, Zuren Feng, Liangjun Ke, Min Li:
Echo State Network for Abrupt Change Detections in Non-stationary Signals. ISDA 2009: 226-231 - 2008
- [j2]Liangjun Ke, Claudia Archetti, Zuren Feng:
Ants can solve the team orienteering problem. Comput. Ind. Eng. 54(3): 648-665 (2008) - [j1]Liangjun Ke, Zuren Feng, Zhigang Ren:
An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognit. Lett. 29(9): 1351-1357 (2008) - [c1]Zhigang Ren, Zuren Feng, Liangjun Ke, Hong Chang:
A fast and efficient ant colony optimization approach for the set covering problem. IEEE Congress on Evolutionary Computation 2008: 1839-1844
Coauthor Index
aka: Zu-ren Feng
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-10-10 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint