: Over the last decade, due to the rapid developments in information technology (IT), a new breed of information systems has appeared such as geographic information systems that in...
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...
Abstract--This paper traces the development of neuralnetwork (NN)-based feedback controllers that are derived from the principle of adaptive/approximate dynamic programming (ADP) a...
Abstract We propose a new featurebased registration method for rigidbody alignment of overlapping point clouds (PCs) efficiently under the influence of noise and outliers. The prop...