Ara
Toplam kayıt 8, listelenen: 1-8
A new heuristic algorithm for multiple traveling salesman problem
(Işık University Press, 2017)
The Multiple Traveling Salesman Problem (mTSP) is a combinatorial optimization problem in NP-hard class. The mTSP aims to acquire the minimum cost for traveling a given set of cities by assigning each of them to a different ...
Independently saturated graphs
(Işık University Press, 2018)
The independence saturation number IS(G) of a graph G = (V, E) is defined as min{IS(V ) : v ∈ V } , where IS(v) is the maximum cardinality of an independent set that contains v. In this paper, we consider and compute exact ...
Network synchronization: Spectral versus statistical properties
(Elsevier B.V., 2006-12)
We consider synchronization of weighted networks, possibly with asymmetrical connections. Focusing on causal relations rather than the observed correlations, we show that the synchronizability of networks cannot be directly ...
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. ...
Optimal and near-optimal partner selection algorithms in cooperative OFDMA
(IEEE, 2012)
We obtain the jointly optimal power allocation and partner selection policies, that maximize the sum rate of a cooperative OFDMA system with mutually cooperating pairs of users. We show that the power allocation and partner ...
Türkçe kelime ağı KeNet için arayüz
(Institute of Electrical and Electronics Engineers Inc., 2019-04)
Kelime ağları, bir dildeki kelimeler arasındaki bağlantıları, eş anlam kümeleri oluşturarak ve bu kümeleri birbirine çeşitli anlamsal bağıntılar ile bağlayarak temsil eden bir çizge veri yapısıdır. Doğal dil işleme alanındaki ...
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 ...
On the maximum cardinality cut problem in proper interval graphs and related graph classes
(Elsevier B.V., 2022-01-04)
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this work we consider the ...