Attack Synthesis for Strings using Meta-Heuristics
نویسندگان
چکیده
منابع مشابه
Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملParallel Meta-heuristics Parallel Meta-heuristics
We present a state-of-the-art survey of parallel meta-heuristic strategies, developments, and results. We discuss general design and implementation principles that apply to most metaheuristic classes and instantiate these principles for neighborhood and population-based metaheuristics. We also identify a number of trends and promising research directions.
متن کاملCollaborating Robotics Using Nature-Inspired Meta-Heuristics
This paper introduces collaborating robots which provide the possibility of enhanced task performance, high reliability and decreased. Collaborating-bots are a collection of mobile robots able to self-assemble and to self-organize in order to solve problems that cannot be solved by a single robot. These robots combine the power of swarm intelligence with the flexibility of self-reconfiguration ...
متن کاملParallel Strategies for Meta-heuristics
We present a state-of-the-art survey of parallel meta-heuristic developments and results, discuss general design and implementation principles that apply to most meta-heuristic classes, instantiate these principles for the three meta-heuristic classes currently most extensively used—genetic methods, simulated annealing, and tabu search, and identify a number of trends and promising research dir...
متن کاملMulti-Agent System for Dynamic Manufacturing Scheduling using Meta-Heuristics
In this paper we will model a Manufacturing System by means of a Multi-Agent Systems, where each agent may represent a processing entity. This work has as objective to deal with the complex problem of Dynamic Scheduling in Manufacturing Systems. We want to prove that a good global solution for a scheduling problem may emerge from a community of machine agents solving locally their schedules and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGSOFT Software Engineering Notes
سال: 2019
ISSN: 0163-5948
DOI: 10.1145/3282517.3282527