Skip to main navigation Skip to search Skip to main content

Weighting-based parallel local search for optimal camera placement and unicost set covering

  • Weibo Lin
  • , Fuda Ma
  • , Zhouxing Su
  • , Qingyun Zhang
  • , Chumin Li
  • , Zhipeng Lü

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

This paper presents a weighting-based parallel local search algorithm (WPLS) for solving the optimal camera placement problem (OCP) and the unicost set covering problem (USCP). The neighborhood exploration of WPLS is parallelizable and hence can be accelerated using parallel computing architectures such as multi-core CPU or GPGPU. © 2020 Owner/Author.
Original languageEnglish
Title of host publicationGECCO '20
Subtitle of host publicationProceedings of the 2020 Genetic and Evolutionary Computation Conference Companion
PublisherAssociation for Computing Machinery
Pages3-4
Number of pages2
ISBN (Print)978-1-4503-7127-8
DOIs
Publication statusPublished - 8 Jul 2020
Externally publishedYes
Event2020 Genetic and Evolutionary Computation Conference (GECCO 2020) - Cancun, Mexico
Duration: 8 Jul 202012 Jul 2020

Publication series

NameGECCO Companion - Proceedings of the Genetic and Evolutionary Computation Conference Companion

Conference

Conference2020 Genetic and Evolutionary Computation Conference (GECCO 2020)
PlaceMexico
CityCancun
Period8/07/2012/07/20

Research Keywords

  • Optimal camera placement
  • Parallel local search
  • Unicost set covering

Fingerprint

Dive into the research topics of 'Weighting-based parallel local search for optimal camera placement and unicost set covering'. Together they form a unique fingerprint.

Cite this