Abstract: The fundamental design choices in an evolutionary algorithm (EA) are its representation of candidate solutions and the operators that will act on that representation. We propose representing ...
Abstract: Minimization of the de-energized consumers load and reduction of the service restoration costs are considered in the proposed heuristic graph-based approach for finding the solution of the ...
Euclidean Minimum Spanning Trees using single-, sesqui-, and dual-tree Borůvka algorithms, which are quite fast in spaces of low intrinsic dimensionality, minimum spanning trees with respect to mutual ...
The reconstruction of tree branching structures is a longstanding problem in Computer Graphics which has been studied over several data sources, from photogrammetry point clouds to Terrestrial and ...
In this paper, we propose a minimum spanning tree-based method for segmenting brain tumors. The proposed method performs interactive segmentation based on the minimum spanning tree without tuning ...
The best algorithm for a computational problem generally depends on the “relevant inputs,” a concept that depends on the application domain and often defies formal articulation. Although there is a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results