We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
— In this paper we present a novel cost benefit operator that assists multi level genetic algorithm searches. Through the use of the cost benefit operator, it is possible to dyna...
George G. Mitchell, Barry McMullin, James Decraene
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...