Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Yasushi Kawase"'
Autor:
Atsushi Miyauchi, Yasushi Kawase
Publikováno v:
PLoS ONE, Vol 11, Iss 1, p e0147805 (2016)
Identifying community structure in networks is an issue of particular interest in network science. The modularity introduced by Newman and Girvan is the most popular quality function for community detection in networks. In this study, we identify a p
Externí odkaz:
https://doaj.org/article/db17c69e801f4783b3af262481b0362f
Autor:
Yasushi Kawase
Publikováno v:
Journal of the Operations Research Society of Japan. 66:95-111
Autor:
Yasushi Kawase, Hanna Sumita
In this paper, we study the following robust optimization problem. Given a set family representing feasibility and candidate objective functions, we choose a feasible set, and then an adversary chooses one objective function, knowing our choice. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1a05cf12e0b9f53e4c8b1b6caa98ae5
https://doi.org/10.21203/rs.3.rs-2679599/v1
https://doi.org/10.21203/rs.3.rs-2679599/v1
Publikováno v:
Algorithmica. 83:1653-1676
This paper studies optimal matroid partitioning problems for various objective functions. In the problem, we are given a finite set $E$ and $k$ weighted matroids $(E, \mathcal{I}_i, w_i)$, $i = 1, \dots, k$, and our task is to find a minimum partitio
Publikováno v:
Algorithmic Game Theory ISBN: 9783031157134
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9069e16ec2f618c9b21de2c7670316e9
https://doi.org/10.1007/978-3-031-15714-1_24
https://doi.org/10.1007/978-3-031-15714-1_24
Autor:
Yasushi Kawase, Hanna Sumita
Publikováno v:
Algorithmic Game Theory ISBN: 9783031157134
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e986b8859b82d970491c0b724b5ef638
https://doi.org/10.1007/978-3-031-15714-1_30
https://doi.org/10.1007/978-3-031-15714-1_30
Autor:
Yasushi Kawase, Hanna Sumita
Publikováno v:
AAAI
We study the problem of fairly allocating a set of indivisible goods to risk-neutral agents in a stochastic setting. We propose an (approximation) algorithm to find a stochastic allocation that maximizes the minimum utility among the agents. The algo
Autor:
Yasushi Kawase, Hanna Sumita
Publikováno v:
AAAI
In this paper, we study the following robust optimization problem. Given an independence system and candidate objective functions, we choose an independent set, and then an adversary chooses one objective function, knowing our choice. The goal is to
Publikováno v:
Theory of Computing Systems. 63:1185-1206
Publikováno v:
Information processing letters.
In this paper, we consider a scheduling problem on multiple speed-scalable processors, where the objective is to minimize a weighted sum of total completion times of jobs and total energy consumption on processors. We propose a simple algorithm for t