Ara
Toplam kayıt 3, listelenen: 1-3
Crossing minimization in weighted bipartite graphs
(Springer, 2007)
Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ...
Searching for the optimal ordering of classes in rule induction
(IEEE, 2012-11-15)
Rule induction algorithms such as Ripper, solve a K > 2 class problem by converting it into a sequence of K - 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in the order of increasing ...
MUNICIPAL: A decision technology for the restoration of critical infrastructures
(Institute of Industrial Engineers, 2013)
This paper describes the decision technology MUNICIPAL (Multi-Network Interdependent Critical Infrastructure Program for the Analysis of Lifelines). This technology supports decision makers in the restoration of critical ...