We describe a genetic algorithm (GA) for designing efficient search paths, against a moving target, in complicated environments. The immediate application is acoustic search for submarines, but the ...

We present a genetic algorithm for the multiple-choice integer program that finds an optimal solution with probability one (though it is typically used as a heuristic). General constraints are relaxed ...

Quantum computers of the future hold promise for solving complex problems more quickly than ordinary computers. For example, they can factor large numbers exponentially faster than classical ...