On the approximation ability of evolutionary optimization with application to minimum set cover

Y Yu, X Yao, ZH Zhou - Artificial Intelligence, 2012 - Elsevier
Evolutionary algorithms (EAs) are heuristic algorithms inspired by natural evolution. They
are often used to obtain satisficing solutions in practice. In this paper, we investigate a …

{PACMan}: Performance Aware Virtual Machine Consolidation

A Roytman, A Kansal, S Govindan, J Liu… - … on Autonomic Computing …, 2013 - usenix.org
Consolidation of multiple workloads, encapsulated in virtual machines (VMs), can
significantly improve efficiency in cloud infrastructures. But consolidation also introduces …

Optimal selection from extremely redundant satellite images for efficient large-scale mapping

P Tao, K Xi, Z Niu, Q Chen, Y Liao, Y Liu, K Liu… - ISPRS Journal of …, 2022 - Elsevier
Nowadays, the substantially increasing optical remote sensing satellites are constantly
generating tremendous amount of images. However, superabundant images would easily …

Information Theory Solution Approach to the Air Pollution Sensor Location–Allocation Problem

Z Mano, S Kendler, B Fishbain - Sensors, 2022 - mdpi.com
Air pollution is one of the prime adverse environmental outcomes of urbanization and
industrialization. The first step toward air pollution mitigation is monitoring and identifying its …

Many-Objective Cover Problem: Discovering Few Solutions to Cover Many Objectives

Y Liu, C Lu, X Lin, Q Zhang - … on Parallel Problem Solving from Nature, 2024 - Springer
Many-objective optimization (MaO) is a basic issue in various research areas. Although
Pareto optimality is a common criterion for MaO, it may bring many troubles when facing a …

A new cost-effective approach for battlefield surveillance in wireless sensor networks

FT Jaigirdar, MM Islam - 2016 International Conference on …, 2016 - ieeexplore.ieee.org
Assuring security (in the form of attacking mode as well as in safeguard mode) and at the
same time keeping strong eye on the opposition's status (position, quantity, availability) is …

Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP

R Hassin, A Keinan - Operations Research Letters, 2008 - Elsevier
We consider greedy algorithms that allow partial regret. As an example we consider a
variant of the cheapest insertion algorithm for the TSP. Our numerical study indicates that in …

Active Scene Flow Estimation for Autonomous Driving via Real-Time Scene Prediction and Optimal Decision

S Wang, R Gao, R Han, J Chen, Z Zhao… - IEEE Transactions …, 2023 - ieeexplore.ieee.org
The active scene flow estimation technology aims at higher quality of scene flow data
through actively changing the ego-vehicle's trajectory as well as sensor observation …

Amplidiff: an optimized amplicon sequencing approach to estimating lineage abundances in viral metagenomes

J Bemmelen, DS Smyth, JA Baaijens - BMC bioinformatics, 2024 - Springer
Background Metagenomic profiling algorithms commonly rely on genomic differences
between lineages, strains, or species to infer the relative abundances of sequences present …

Improved quantum state tomography for systems with couplings and readouts

T Xin - Physical Review A, 2020 - APS
Quantum device characterization via state tomography plays an important role in both
validating quantum hardware and processing quantum information, but it needs the …