Bioinspired Optimization Methods and Their Applications: 10th International Conference, BIOMA 2022, Maribor, Slovenia, November 17–18, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13627
Editat de Marjan Mernik, Tome Eftimov, Matej Črepinšeken Limba Engleză Paperback – 5 noi 2022
The papers in this BIOMA proceedings specialized in bioinspired algorithms as a means for solving the optimization problems and came in two categories: theoretical studies and methodology advancements on the one hand, and algorithm adjustments and their applications on the other.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 409.03 lei
Preț vechi: 511.29 lei
-20% Nou
Puncte Express: 614
Preț estimativ în valută:
78.28€ • 81.31$ • 65.02£
78.28€ • 81.31$ • 65.02£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031210938
ISBN-10: 303121093X
Pagini: 277
Ilustrații: X, 277 p. 70 illus., 59 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.41 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 303121093X
Pagini: 277
Ilustrații: X, 277 p. 70 illus., 59 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.41 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
An agent-based model to investigate different behaviours in a crowd simulation.- Accelerating Evolutionary Neural Architecture Search for Remaining Useful Life Prediction.- ACOCaRS: Ant Colony Optimization Algorithm for Traveling Car Renter Problem.- A new type of anomaly detection problem in dynamic graphs: An ant colony optimization approach.- CSS- A Cheap-Surrogate-based Selection Operator for Multi-objective Optimization.- Empirical Similarity Measure for Metaheuristics.- Evaluation of Parallel Hierarchical Differential Evolution for Min-Max Optimization Problems Using SciPy.- Explaining Differential Evolution Performance Through Problem Landscape Characteristics.- Genetic improvement of TCP congestion avoidance.- Hybrid Acquisition Processes in Surrogate-based Optimization. Application to Covid-19 Contact Reduction.- Investigating the Impact of Independent Rule Fitnesses in a Learning Classifier System.- Modified Football Game Algorithm for Multimodal Optimization of Test TaskScheduling Problems Using Normalized Factor Random Key Encoding Scheme.- Performance Analysis of Selected Evolutionary Algorithms.- Refining Mutation Variants in Cartesian Genetic Programming.- Slime mould algorithm: An experimental study of nature-inspired optimizer.- SMOTE inspired extension for differential evolution.- The Influence of Local Search over Genetic Algorithms with Balanced Representations.- Trade-off of networks on weighted space analyzed via a method mimicking human walking track superposition.- Towards interpretable policies in multi-agent reinforcement learning tasksb.