We consider the problem of adapting approximate dynamic programming techniques to the inverted pendulum task. This is a particularly challenging task as we work with a relatively uninformative reinforcement signal and have no a priori information about our system. Success in this task requires an effective solution to the credit assignment problem, incorporation of noisy and biased information ...

This paper presents a Hybrid Particle Swarm Optimization (HPSO) method for solving the Task Assignment Problem (TAP) which is an np-hard problem. Particle Swarm Optimization (PSO) is a recently developed population based heuristic optimization technique. The algorithm has been developed to dynamically schedule heterogeneous tasks on to heterogeneous processors in a distributed setup. Load balan...

We model the problem of monolingual textual alignment as a Quadratic Assignment Problem (QAP) which simultaneously maximizes the global lexicosemantic and syntactic similarities of two sentence-level texts. Because QAP is an NP-complete problem, we propose a branch-and-bound approach to efficiently find an optimal solution. When compared with other methods and studies, our results are competitive.

The quadratic assignment problem (QAP) was first proposed by Koopmans and Beckman [5] in the context of the plant location problem. Given n facilities, represented by the set F f1 fn , and n locations represented by the set L l1 ln , one must determine to which location each facility must be assigned. Let An n ai j be a matrix where ai j represents the flow between facilities fi and f j. Let Bn...

In many applications it is necessary to find a minimum weight assignment that satisfies one or several additional resource constraints. For example, consider the problem of assigning persons to jobs where each assignment utilizes at least two scarce resources and the resource utilization is dependent on the person and the type of task. A practical situation where the above might occur is a slau...

The partitioning of fixed-priority hard real-time tasks and messages in a distributed system is a well known NP-hard problem. Therefore, there are no methods that provide an optimal solution in polynomial time. In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic, which simultaneously solves the problem of assigning task to processors and assigning priori...

Whenever tasks of an application are scheduled in Heterogeneous Distributed Computing environment, idle slots on processors are efficiently utilized to minimize the overall running time. Since task assignment problem has been proved to be NP-complete problem, many heuristics