Neighbourhood analysis: A case study on google machine reassignment problem

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

Turky, Ayad ORCID: 0000-0001-8415-7328, Sabar, NR ORCID: 0000-0002-0276-4704 and Song, Andy (2017) Neighbourhood analysis: A case study on google machine reassignment problem. In: Australasian Conference on Artificial Life and Computational Intelligence (ACALCI 2017), 31 Jan 2017 - 2 Feb 2017, Geelong, Australia.

Dimensions Badge

Altmetric Badge

Item type Conference or Workshop Item (Paper)
URI https://vuir.vu.edu.au/id/eprint/42944
DOI https://doi.org/10.1007/978-3-319-51691-2_20
Official URL https://link.springer.com/chapter/10.1007%2F978-3-...
ISBN 9783319516905
Subjects Current > FOR (2020) Classification > 4602 Artificial intelligence
Current > Division/Research > College of Science and Engineering
Keywords neighbourhood structures; combinatorial optimisation; steepest descent algorithm; cloud computing
Citations in Scopus 8 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login