Abstract: In this paper, we mainly focus on a comparison of three types of dynamic programming based algorithms for optimal and near-optimal solutions of traffic signal control problem. The algorithms ...

We introduce novel algorithms for solving dynamic programming problems in economics on a quantum annealer, a specialized quantum computer used for combinatorial optimization. Quantum annealers begin ...

Dynamic Programming is a paradigm of algorithm design in which an optimization problem is solved by a combination of achieving sub-problem solutions and appearing to the "principle of optimality".

Abstract: This paper proposes a dynamic programming algorithm for management of aircraft power supply system, which takes reliability as the optimization goal, and the power supply priority, the basic ...

The Smith-Waterman algorithm is a dynamic programming algorithm to find the optimal alignment of two sequences. This repository provides a basic implementation of the Smith-Waterman algorithm that has ...

Having lectured in some universities and polytechnics in Nigeria, the researchers observed problems in course allocations. There are no lay-down techniques on how courses should be allocated with ...

On 4 August 2005, the police department of Memphis, Tennessee, made so many arrests over a three-hour period that it ran out of vehicles to transport the detainees to jail. Three days later, 1,200 ...

ABSTRACT: A parallel version of the traditional grid based cost-to-go function generation algorithm used in robot path planning is introduced. The process takes advantage of the spatial layout of an ...