An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots
H Qu, K **ng, T Alexander - Neurocomputing, 2013 - Elsevier
This paper presents a Co-evolutionary Improved Genetic Algorithm (CIGA) for global path
planning of multiple mobile robots, which employs a co-evolution mechanism together with …
planning of multiple mobile robots, which employs a co-evolution mechanism together with …
Selecting subexpressions to materialize at datacenter scale
We observe significant overlaps in the computations performed by user jobs in modern
shared analytics clusters. Naïvely computing the same subexpressions multiple times results …
shared analytics clusters. Naïvely computing the same subexpressions multiple times results …
Multiple query optimization using a gate-based quantum computer
Quantum computing promises to solve difficult optimization problems in chemistry, physics
and mathematics more efficiently than classical computers. However, it requires fault …
and mathematics more efficiently than classical computers. However, it requires fault …
Efficient decision makings for dynamic weapon-target assignment by virtual permutation and tabu search heuristics
The dynamic weapon-target assignment (DWTA) problem is a typical constrained
combinatorial optimization problem with the objective of maximizing the total value of …
combinatorial optimization problem with the objective of maximizing the total value of …
Multiple query optimization on the D-Wave 2X adiabatic quantum computer
The D-Wave adiabatic quantum annealer solves hard combinatorial optimization problems
leveraging quantum physics. The newest version features over 1000 qubits and was …
leveraging quantum physics. The newest version features over 1000 qubits and was …
Applicability of quantum computing on database query optimization
M Schönberger - Proceedings of the 2022 International Conference on …, 2022 - dl.acm.org
We evaluate the applicability of quantum computing on two fundamental query optimization
problems, join order optimization and multi query optimization (MQO). We analyze the …
problems, join order optimization and multi query optimization (MQO). We analyze the …
A robust island parallel genetic algorithm for the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a difficult and important problem studied in the
domain of combinatorial optimisation. It is possible to solve QAP instances with 10--20 …
domain of combinatorial optimisation. It is possible to solve QAP instances with 10--20 …
An evolutionary genetic algorithm for optimization of distributed database queries
High-performance low-cost PC hardware and high-speed LAN/WAN technologies make
distributed database (DDB) systems an attractive research area where query optimization …
distributed database (DDB) systems an attractive research area where query optimization …
A workload balancing genetic algorithm for the quay crane scheduling problem
SH Chung, FTS Chan - International Journal of Production …, 2013 - Taylor & Francis
This paper proposes a novel genetic algorithm to deal with the quay crane scheduling
problem (QCSP), which is known to be one of the most critical tasks in terminal operations …
problem (QCSP), which is known to be one of the most critical tasks in terminal operations …
Competitive dynamics in the operating systems market: Modeling and policy implications
Based on concepts of population dynamics and organizational ecology, the study analyzes
the evolutionary and competitive dynamics of the highly concentrated desktop/laptop …
the evolutionary and competitive dynamics of the highly concentrated desktop/laptop …