Longkun Guo
Citata da
Citata da
Self-adaptive resource allocation for cloud-based software services based on iterative QoS prediction model
X Chen, H Wang, Y Ma, X Zheng, L Guo
Future Generation Computer Systems 105, 287-296, 2020
Efficient approximation algorithms for the bounded flexible scheduling problem in clouds
L Guo, H Shen
IEEE Transactions on Parallel and Distributed Systems 28 (12), 3511-3520, 2017
On Finding Min-Min Disjoint Paths
L Guo, H Shen
Algorithmica 66 (3), 641-653, 2013
A framework for optimizing extended belief rule base systems with improved Ball trees
YG Fu, JH Zhuang, YP Chen, LK Guo, YM Wang
Knowledge-Based Systems 210, 106484, 2020
Fast anomaly detection in multiple multi-dimensional data streams
H Sun, Q He, K Liao, T Sellis, L Guo, X Zhang, J Shen, F Chen
2019 IEEE International Conference on Big Data (Big Data), 1218-1223, 2019
Participant selection for t-sweep k-coverage crowd sensing tasks
Z Yu, J Zhou, W Guo, L Guo, Z Yu
World Wide Web 21, 741-758, 2018
Efficient approximation algorithms for multi-antennae largest weight data retrieval
L Guo, H Shen, W Zhu
IEEE Transactions on Mobile Computing 16 (12), 3320-3333, 2017
Linear time algorithm for computing min‐max movement of sink‐based mobile sensors for line barrier coverage
W Zou, L Guo, P Huang, G Lin, H Mei
Concurrency and Computation: Practice and Experience 34 (2), e6175, 2022
Improved approximation algorithms for computing k disjoint paths subject to two constraints
L Guo, H Shen, K Liao
Journal of Combinatorial Optimization 29 (1), 153-164, 2015
A fast algorithm for optimally finding partially disjoint shortest paths
L Guo, Y Deng, K Liao, Q He, T Sellis, Z Hu
Twenty-Seventh International Joint Conference on Artificial Intelligence …, 2018
Efficient approximation algorithms for computing k disjoint restricted shortest paths
L Guo, K Liao, H Shen, P Li
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
Efficient approximation algorithms for computing k disjoint constrained shortest paths
L Guo
Journal of Combinatorial Optimization 32, 144-158, 2016
The Seeding Algorithm for Spherical k-Means Clustering with Penalties
S Ji, D Xu, L Guo, M Li, D Zhang
Journal of Combinatorial Optimization,, 2020
On the complexity of the edge-disjoint min–min problem in planar digraphs
L Guo, H Shen
Theoretical computer science 432, 58-63, 2012
Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks
H Shen, L Guo
Computers, IEEE Transactions on 61 (7), 954-968, 2012
Efficient approximation algorithms for computing k-disjoint minimum cost paths with delay constraint
L Guo, H Shen
2012 13th International Conference on Parallel and Distributed Computing …, 2012
Minsum movement of barrier and target coverage using sink-based mobile sensors on the plane
L Guo, W Zou, C Wu, D Xu, D Du
2021 IEEE 41st International Conference on Distributed Computing Systems …, 2021
Efficient approximation algorithms for maximum coverage with group budget constraints
L Guo, M Li, D Xu
Theoretical Computer Science 788, 53-65, 2019
Efficient algorithms for flexible sweep coverage in crowdsensing
P Huang, W Zhu, K Liao, T Sellis, Z Yu, L Guo
IEEE Access 6, 50055-50065, 2018
Improved approximation algorithms for constrained fault-tolerant resource allocation
K Liao, H Shen, L Guo
Theoretical Computer Science 590, 118-128, 2015
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20