Konu "Approximation algorithms" için listeleme
Toplam kayıt 6, listelenen: 1-6
-
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. ... -
Crossing minimization in weighted bipartite graphs
(Elsevier B.V., 2009-12)Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ... -
Imaging of rough surfaces by RTM method
(IEEE, 2024)An electromagnetic imaging framework is implemented utilizing a single frequency reverse time migration (RTM) technique to accurately reconstruct inaccessible two-dimensional (2D) rough surface profiles from the knowledge ... -
Low complexity least minimum symbol error rate based post-distortion for vehicular VLC
(Institute of Electrical and Electronics Engineers Inc., 2020-10-22)Vehicular visible light communications (VLC) has emerged as a viable supplement for high speed next-generation vehicle to vehicle (V2V) communication systems. However, performance of a V2V-VLC link is impaired due to ... -
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 ... -
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 ...