Buscar
Mostrando ítems 1-10 de 1715
Hierarchical coefficient of a multifractal based network
(Elsevier, 2014-02-15)
Griffiths phases in infinite- dimensional, non- hierarchical modular networks
(Scientific Reports, 2019)
Optimal design of hierarchical networks with free main path extremes
(ELSEVIER SCIENCE BV, 2008)
We propose an optimal, two-stage procedure for the optimal design of minimum cost hierarchical spanning networks, consisting of a main path and secondary trees. The optimal location of the origin and destination nodes of ...
Hierarchical multi-label classification using local neural networks
(ElsevierAcademic PressSan Diego, 2014-02)
Hierarchical multi-label classification is a complex classification task where the classes involved in the problem are hierarchically structured and each example may simultaneously belong to more than one class in each ...
Classification and characterization of places for mapping of environment using hierarchical neural network and omnivision
(Slovak Univ Tech Bratislava, 2008-01-01)
Mobile robots need autonomy to fulfill their tasks. Such autonomy is related whith their capacity to explorer and to recognize their navigation environments. In this context, the present work considers techniques for the ...
Environment mapping for mobile robots navigation using hierarchical neural network and omnivision
(2008-11-24)
Autonomous robots must be able to learn and maintain models of their environments. In this context, the present work considers techniques for the classification and extraction of features from images in joined with artificial ...
A branch and cut algorithm for the hierarchical network design problem
(ELSEVIER SCIENCE BV, 2010)
The Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting ...
An optimal procedure for solving the hierarchical network design problem
(TAYLOR & FRANCIS INC, 2007)
The hierarchical network design problem consists of finding a minimum cost bilevel network that connects all the nodes in a set, created by a loopless main path and a forest. The main path is formed by primary (higher cost) ...