Ara
Toplam kayıt 2, listelenen: 1-2
On the online coalition structure generation problem
(AI Access Foundationusc Information Sciences Inst, 2021)
We consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online fashion and have to be partitioned into coalitions by an authority ...
Hierarchical b-Matching
(Springer Science and Business Media Deutschland GmbH, 2021)
A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a b-matching every vertex v has an associated bound bv, and a maximum ...