Simulated annealing algorithm combined with chaos for task allocation in real-time distributed systems
From MaRDI portal
Publication:1717764
DOI10.1155/2014/151394zbMath1407.90376OpenAlexW2020353084WikidataQ59063243 ScholiaQ59063243MaRDI QIDQ1717764
Baohong Liu, Xinyu Yao, Wenbo Wu, Jia-hong Liang
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/151394
Related Items (1)
Cites Work
- Optimization by Simulated Annealing
- Imperialist competitive algorithm combined with chaos for global optimization
- Reliability and cost optimization in distributed computing systems.
- Comparing three heuristic search methods for functional partitioning in hardware--software codesign
- Optimal task allocation and hardware redundancy policies in distributed computing systems
- Application of chaos in simulated annealing
- Task allocation for maximizing reliability of distributed systems: a simulated annealing approach
- Improved particle swarm optimization combined with chaos
- Distributed program reliability analysis
- Cooling Schedules for Optimal Annealing
- Job Shop Scheduling by Simulated Annealing
- A generalized algorithm for evaluating distributed-program reliability
- Equation of State Calculations by Fast Computing Machines
This page was built for publication: Simulated annealing algorithm combined with chaos for task allocation in real-time distributed systems
