Titlebook: Recent Advances in Computational Optimization; Results of the Works Stefka Fidanova Book 2018 Springer International Publishing AG 2018 Com

供過(guò)于求

Verification of Correctness of Parallel Algorithms in Practice, detail how to show that a parallel algorithm is correct. This process involves proving its safety and liveness. In our case study, we prove the correctness of our two parallel algorithms for the NP-hard pickup and delivery problem with time windows. Both algorithms (for minimizing the number of rou

哺乳動(dòng)物

Application of Fuzzy Cognitive Maps with Evolutionary Learning Algorithm to Model Decision Support historical data. FCM models learned from data are denser than those created by humans. We developed an evolutionary learning approach for fuzzy cognitive maps based on density and system performance indicators. It allows to select only the most significant connections between concepts and receive th

吞吞吐吐

Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Rign, simulation, and implementation more and more challenging. Memory management is among the main challenge that electronic designers have to face. In fact, it impacts heavily the main cost metrics, including area, performance (real-time aspect) and energy consumption, of modern-day electronic devi

責(zé)難

ANT

commensurate

服從

貴族

1860-949X .Constitutes a comprehensive collection of extended contribu.This book presents new optimization approaches and methods and their application in real-world and industrial problems, and demonstrates how many of the problems arising in engineering, economics and other domains can be formulated as opti

Jogging

圓桶

On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1,nce of interval distances. Backtracking pruning is introduced in the algorithm for guaranteeing that all vertex positions in a given solution are actually feasible. The proposed algorithm is tested on a set of artificially generated instances in dimension?1.