3 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 3 / 3
Yayın Crossing minimization in weighted bipartite graphs(Elsevier B.V., 2009-12) Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, MelihGiven 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 problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edges have nonnegative weights. Although this problem is more general and finds specific applications in automatic graph layout problems similar to those of the unweighted case, it has not received as much attention. We provide a new technique that efficiently approximates a solution to this more general problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.Yayın Searching for the optimal ordering of classes in rule induction(IEEE, 2012-11-15) Ata, Sezin; Yıldız, Olcay TanerRule 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 prior probabilities. In this paper, we propose two algorithms to improve this heuristic. The first algorithm starts with the ordering the heuristic provides and searches for better orderings by swapping consecutive classes. The second algorithm transforms the ordering search problem into an optimization problem and uses the solution of the optimization problem to extract the optimal ordering. We compared our algorithms with the original Ripper on 8 datasets from UCI repository [2]. Simulation results show that our algorithms produce rulesets that are significantly better than those produced by Ripper proper.Yayın Genetik algoritma ile kesirli dereceli sistemler için frekans tabanlı yaklaşımların karşılaştırılması(Institute of Electrical and Electronics Engineers Inc., 2025-08-15) Astekin, Dorukhan; Değirmenci, Ali Murat; İstefanopulos, YorgoKesirli dereceli sistemler tam sayı yerine kesirli tümlevsel veya türevsel terimlerin yer aldığı sistemlerdir ve yapısı gereği hesaplama zorluğunu da beraberinde getirmektedir. Bu nedenle birçok çalışmada kesirli dereceli sistemler için bazı yaklaşım yöntemleri araştırmacılar tarafından önerilmektedir. Bu çalışma kapsamında kesirli dereceli sistemler için frekans tabanlı yaklaşım yöntemlerinin karşılaştırılmalı çalışması ve eniyileme yöntemlerinden biri olan genetik algoritma ile tasarlanan kesirli dereceli PID denetleyici ile kesirli dereceli sistemin ve yaklaşımlarının karşılaştırılması sunulmaktadır. Karşılaştırılan yöntemler MATLAB/Simulink ortamında modellenerek benzetim sonuçları verilmektedir.
