Buscar
Mostrando ítems 1-10 de 68
WAN design with demand, hop limit and path diversity constraints
(UR. FI-INCO,, 2008)
This thesis presents a challenging telecommunication network design problem, in which the network designer has to assure not only connectivity, but also some degree of performance guarantee and survivability to the solution. ...
Nonseparating planar chains in 4-connected graphs
(Siam PublicationsPhiladelphiaEUA, 2005)
Survivable capacitated network design problem: new formulation and Lagrangean relaxation
(PALGRAVE MACMILLAN LTD, 2000)
This work is focused on the analysis of the survivable capacitated network design problem. This problem can be stated as follows: Given a supply network with point-to-point traffic demands, specific survivability requirements, ...
On the connection between the undirected and the Acyclic Directed Two Disjoint Paths Problem
(Charles Babbage Res CtrWinnipegCanadá, 1997)
Improving Accuracy and Speed of Optimum-Path Forest Classifier Using Combination of Disjoint Training Subsets
(Springer, 2011-01-01)
The Optimum-Path Forest (OPF) classifier is a recent and promising method for pattern recognition, with a fast training algorithm and good accuracy results. Therefore, the investigation of a combining method for this kind ...
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
(Wiley-Liss Inc., 2019)
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours, given that ...
Improving accuracy and speed of optimum-path forest classifier using combination of disjoint training subsets
(2011-09-26)
The Optimum-Path Forest (OPF) classifier is a recent and promising method for pattern recognition, with a fast training algorithm and good accuracy results. Therefore, the investigation of a combining method for this kind ...
Improving accuracy and speed of optimum-path forest classifier using combination of disjoint training subsets
(2011-09-26)
The Optimum-Path Forest (OPF) classifier is a recent and promising method for pattern recognition, with a fast training algorithm and good accuracy results. Therefore, the investigation of a combining method for this kind ...
Centralidade de proximidade por múltiplos caminhos disjuntosDisjoint multipath closeness centrality
(Universidade Federal do Rio de JaneiroBrasilInstituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de EngenhariaPrograma de Pós-Graduação em Engenharia ElétricaUFRJ, 2021)