Graph Matching Algorithm for Task Assignment Problem
نویسندگان
چکیده
منابع مشابه
Hybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملhybrid meta-heuristic algorithm for task assignment problem
task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...
متن کاملA Graduated Assignment Algorithm for Graph Matching
A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated non-convexity (deterministic annealing), two-way (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational complexity (O(lm), where l and m are the number of links in the two graphs...
متن کاملAnt Algorithm for the Graph Matching Problem
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-labeled graphs. This new ACO algorithm is experimentally compared with greedy and reactive tabu approaches on subgraph isomorphism problems and on multivalent graph matching problems.
متن کاملA Modified Parallel Heuristic Graph Matching Approach for Solving Task Assignment Problem in Distributed Processor System
Task assignment is one of the most fundamental combinatorial optimization problems. Solving the Task Assignment Problem is very important for many real time and computational scenarios where a lot of small tasks need to be solved by multiple processors simultaneously. In this paper a Heuristic and Parallel Algorithm for Task Assignment Problem is proposed. Results obtained for certain cases are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science, Engineering and Applications
سال: 2011
ISSN: 2231-0088
DOI: 10.5121/ijcsea.2011.1609