Results 41 to 50 of about 128,042 (286)
The generalized minimum spanning tree polytope and related polytopes [PDF]
, 2001 The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each ...
Pop, P.C.
core +1 more source
Ant Colony Optimization and the Minimum Spanning Tree Problem [PDF]
Theoretical Computer Science, 2008 Ant Colony Optimization (ACO) is a kind of randomized search heuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed by a random walk on a so-called construction graph. This random walk can be influenced by heuristic information about the problem.
Neumann, F., Witt, C.
openaire +7 more sources
Advanced Functional Materials, EarlyView.This review highlights how machine learning (ML) algorithms are employed to enhance sensor performance, focusing on gas and physical sensors such as haptic and strain devices. By addressing current bottlenecks and enabling simultaneous improvement of multiple metrics, these approaches pave the way toward next‐generation, real‐world sensor applications.
Kichul Lee +17 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Permanent magnets derive their extraordinary strength from deep, universal electronic‐structure principles that control magnetization, anisotropy, and intrinsic performance. This work uncovers those governing rules, examines modern modeling and AI‐driven discovery methods, identifies critical bottlenecks, and reveals electronic fingerprints shared ...
Prashant Singh
wiley +1 more source
The Spanning Tree of a Divisible Multiple Graph
Моделирование и анализ информационных систем, 2018 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges.
Alexander V. Smirnov
doaj +1 more source
International Journal of Computational Intelligence Systems, 2022 The constrained optimization problems can be transformed into multi-objective optimization problems, and thus can be optimized by multi-objective evolutionary algorithms.
Xinsheng Lai
doaj +1 more source
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size [PDF]
, 2001 Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster.
Kern, W., Pop, P.C., Still, G.J.
core +1 more source
The delay-constrained minimum spanning tree problem [PDF]
Proceedings Second IEEE Symposium on Computer and Communications, 2002 We formulate the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks. Then, we prove that this problem is NP-complete, and we propose an efficient heuristic to solve the problem based on Prim's ...
H.F. Salama, D.S. Reeves, Y. Viniotis
openaire +1 more source
Computational Modeling Meets 3D Bioprinting: Emerging Synergies in Cardiovascular Disease Modeling
Advanced Healthcare Materials, EarlyView.Emerging advances in three‐dimensional bioprinting and computational modeling are reshaping cardiovascular (CV) research by enabling more realistic, patient‐specific tissue platforms. This review surveys cutting‐edge approaches that merge biomimetic CV constructs with computational simulations to overcome the limitations of traditional models, improve ...
Tanmay Mukherjee +7 more
wiley +1 more source
Double-Type Ant Colony Algorithm Considering Dynamic Guidance and Neighborhood Interaction
Jisuanji kexue yu tansuo, 2020 When solving traveling salesman problem (TSP), the ant colony algorithm is easy to fall into local optimum and convergence speed is slow, a double-type ant colony algorithm considering dynamic guidance and neighborhood interaction is proposed.
PAN Han, YOU Xiaoming, LIU Sheng
doaj +1 more source