Pricelists.org Pricelists.org Giriş yap Kayıt ol

Evolutionary Multi-Task Optimization

☆☆☆☆☆ (0 reviews)
Show price history
Evolutionary Multi-Task Optimization
Lowest price (incl. delivery)
24 324,00 JPY
Typical price8 196,93 PLN
Lowest (90 days)104,99 PLN
Offers1
Last updated1 gün önce
See best offer
Satıcı Product price Delivery Toplam Stok Durumu Updated
SP Springer Nature Author 24 309,00 JPY 15,00 JPY 24 324,00 JPY Mevcut 1 gün önce View offer

Fiyatlar ve stok durumu değişebilir. Son Güncelleme: 08.08.2026 22:39.

EAN 9789811956522
Springer Nature
0,0
☆☆☆☆☆
0 reviews
5★ 0%
4★ 0%
3★ 0%
2★ 0%
1★ 0%

Product reviews

Rating
No reviews yet — be the first!
A remarkable facet of the human brain is its ability to manage multiple tasks with apparent simultaneity. Knowledge learned from one task can then be used to enhance problem-solving in other related tasks. In machine learning, the idea of leveraging relevant information across related tasks as inductive biases to enhance learning performance has attracted significant interest. In contrast, attempts to emulate the human brain’s ability to generalize in optimization – particularly in population-based evolutionary algorithms – have received little attention to date. Recently, a novel evolutionary search paradigm, Evolutionary Multi-Task (EMT) optimization, has been proposed in the realm of evolutionary computation. In contrast to traditional evolutionary searches, which solve a single task in a single run, evolutionary multi-tasking algorithm conducts searches concurrently on multiple search spaces corresponding to different tasks or optimization problems,each possessing a unique function landscape. By exploiting the latent synergies among distinct problems, the superior search performance of EMT optimization in terms of solution quality and convergence speed has been demonstrated in a variety of continuous, discrete, and hybrid (mixture of continuous and discrete) tasks. This book discusses the foundations and methodologies of developing evolutionary multi-tasking algorithms for complex optimization, including in domains characterized by factors such as multiple objectives of interest, high-dimensional search spaces and NP-hardness.

Similar products