This dataset contains the data for the paper CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization. In this paper, we introduce CO-Bench, a benchmark suite ...
Quantum Computing Application Benchmark (QUARK) is a framework for orchestrating benchmarks of different industry-relevant applications on quantum computers. QUARK supports various applications such ...
Abstract: An improved genetic algorithm incorporating simulated annealing operations is proposed to address the coverage path planning problem for fixed-wing unmanned aerial vehicles (UAVs). After ...
We propose a dual-resolution scheme to achieve time-efficient autonomous exploration with one or many robots. The scheme maintains a high-resolution local map of the robot’s immediate vicinity and a ...
In recent years, extreme natural disasters have occurred frequently, causing a huge impact on the power grid. In this paper, the method of purchasing and deployment of resources of the distribution ...
The traveling salesman problem (TSP) is the most popular and most studied non-deterministic polynomial (NP) hard problem that has been used in various fields of science and technology. Due to the ...
Finding the shortest tour visiting all given points at least ones belongs to the most famous optimization problems until today [travelling salesman problem (TSP)]. Optimal solutions exist for many ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results