Subset selection problems in planar point sets
Аннотация
Publication date: January 2027 Source: European Journal of Combinatorics, Volume 139 Author(s): József Balogh, Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu
Publication date: January 2027 Source: European Journal of Combinatorics, Volume 139 Author(s): József Balogh, Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu
Reconstructing DNA sequences without a reference, known as de novo assembly, is a complex computational task involving the alignment of overlapping fragments. To address this problem, a usual strategy is to map the assembly to a...
A novel approach is introduced that enables the automatic generation of hybrid quantum-classical neural networks using a two-step optimization process, combining multiobjective genetic algorithms specifically designed for time series on...
Hybrid variational quantum algorithms are promising for solving practical problems in application areas, which include quantum machine learning, combinatorial optimization, and quantum chemistry simulation on noisy quantum computers....
The Variational Quantum Eigensolver (VQE) is one of the most promising algorithms for current quantum devices. It employs a classical optimizer to iteratively update the parameters of a variational quantum circuit in order to search for...
The importance of analyzing nontrivial datasets when testing quantum machine learning (QML) models is becoming increasingly prominent in literature, yet a cohesive framework for understanding dataset characteristics remains elusive. In...