Real-time solutions to the influence blocking maximization (IBM) problem...
The multiple-choice knapsack problem (MCKP) is a classic NP-hard
combina...
Large Language Models (LLMs) have demonstrated exceptional performance i...
Multi-domain learning (MDL) refers to simultaneously constructing a mode...
Word-level textual adversarial attacks have achieved striking performanc...
Attack Ensemble (AE), which combines multiple attacks together, provides...
It has been widely observed that there exists no universal best
Multi-ob...
Traditional solvers for tackling combinatorial optimization (CO) problem...
Social recommendations utilize social relations to enhance the represent...
Deep neural networks are vulnerable to adversarial examples, even in the...
This work considers a challenging Deep Neural Network (DNN) quantization...
The field of adversarial textual attack has significantly grown over the...
Over the past few years, various word-level textual attack approaches ha...
Black-box problems are common in real life like structural design, drug
...
The vehicle routing problem with simultaneous pickup-delivery and time
w...
Generalization, i.e., the ability of addressing problem instances that a...
The Travelling Salesman Problem (TSP) is a classical NP-hard problem and...
Over the last decade, research on automated parameter tuning, often refe...
Simultaneously utilizing several complementary solvers is a simple yet
e...
This paper studies improving solvers based on their past solving experie...