Parallel late acceptance hill-climbing algorithm for the google machine reassignment problem

Download
Full text for this resource is not available from the Research Repository.
Export

Turky, Ayad ORCID logoORCID: https://orcid.org/0000-0001-8415-7328, Sabar, NR, Sattar, A and Song, Andy (2016) Parallel late acceptance hill-climbing algorithm for the google machine reassignment problem. In: AI 2016 : 29th Australasian Joint Conference on Artificial Intelligence, 5 Dec 2016 - 8 Dec 2016, Hobart, Australia.

Dimensions Badge

Altmetric Badge

View Altmetric information about this item.

Item type Conference or Workshop Item (Paper)
URI https://vuir.vu.edu.au/id/eprint/42920
DOI 10.1007/978-3-319-50127-7_13
Official URL https://link.springer.com/chapter/10.1007%2F978-3-...
ISBN 9783319501260
Subjects Current > FOR (2020) Classification > 4602 Artificial intelligence
Current > Division/Research > College of Science and Engineering
Keywords resource optimisation; cloud computing; resource allocation; search algorithm; evolutionary algorithm
Citations in Scopus 13 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login

CORE (COnnecting REpositories)