A new evolutionary algorithm for the constrained multiple destination routing problem is presented. The constrained multicast problem is characterized by a minimum cost multicast tree and a bounded end-to-end delay. I...
详细信息
A new evolutionary algorithm for the constrained multiple destination routing problem is presented. The constrained multicast problem is characterized by a minimum cost multicast tree and a bounded end-to-end delay. It has been proven that this problem is NP-complete. The proposed algorithm is based on a soft computing technique that integrates in an efficient manner the merits of genetic algorithms and concepts of the competitive learning in the artificial neural networks literature. A population based learning algorithm is utilized, among other techniques, to construct a delay bounded multicast tree. A salient feature of the algorithm is the adaptive learning concept that achieves an efficient trade-off between the exploration and exploitation of the search space.
Vehicle platooning has been shown to be quite fruitful in the transportation industry to enhance fuel economy, road throughput, and driving comfort. Model Predictive Control (MPC) is widely used in literature for plat...
详细信息
Continual learning (CL) provides a framework for training models in ever-evolving environments. Although re-occurrence of previously seen objects or tasks is common in real-world problems, the concept of repetition in...
详细信息
International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from t...
International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.
暂无评论