A
Albert Y. Zomaya
Researcher at University of Sydney
Publications - 1020
Citations - 30827
Albert Y. Zomaya is an academic researcher from University of Sydney. The author has contributed to research in topics: Cloud computing & Scheduling (computing). The author has an hindex of 75, co-authored 946 publications receiving 24637 citations. Previous affiliations of Albert Y. Zomaya include University of Alabama & University of Sheffield.
Papers
More filters
Journal ArticleDOI
A Novel Generation-Adversarial-Network-Based Vehicle Trajectory Prediction Method for Intelligent Vehicular Networks
TL;DR: This work proposes a generative adversarial network (GAN)-based vehicle trajectory prediction method, GAN-VEEP, for urban roads that exhibits higher effectiveness in terms of the average accuracy, mean absolute error, and root-mean-squared error.
Journal ArticleDOI
A Dynamic Programming Algorithm for Leveraging Probabilistic Detection of Energy Theft in Smart Home
TL;DR: A new dynamic programming algorithm is proposed that inserts the minimum number of FRTUs satisfying the detection rate constraint and can perform FRTU insertion for a large scale power system.
Journal ArticleDOI
Building a Sustainable Internet of Things: Energy-Efficient Routing Using Low-Power Sensors Will Meet the Need
TL;DR: A novel data-routing technique to forward data toward a base station using a mobile data collector, in which two data collectors follow a predefined path to collect data by covering the entire network, which improves the network performance, including energy consumption and sensing area lifetime.
Journal ArticleDOI
Traffic-Aware Geo-Distributed Big Data Analytics with Predictable Job Completion Time
TL;DR: This paper studies to minimize the inter-DC traffic generated by MapReduce jobs targeting on geo-distributed big data, while providing predicted job completion time by applying the chance-constrained optimization technique.
Journal ArticleDOI
Cost Minimization for Rule Caching in Software Defined Networking
TL;DR: This paper formulates a minimum weighted flow provisioning ( MWFP) problem with an objective of minimizing the total cost of TCAM occupation and remote packet processing and proposes two online algorithms with guaranteed competitive ratios.