Zobrazeno 1 - 10
of 7 006
pro vyhledávání: '"WANG, Haitao"'
Autor:
Wang, Haitao
甲第25380号
人博第1122号
新制||人||261(附属図書館)
学位規則第4条第1項該当
Doctor of Human and Environmental Studies
Kyoto University
DGAM
人博第1122号
新制||人||261(附属図書館)
学位規則第4条第1項該当
Doctor of Human and Environmental Studies
Kyoto University
DGAM
Externí odkaz:
http://hdl.handle.net/2433/288814
Credit assignment is a core problem that distinguishes agents' marginal contributions for optimizing cooperative strategies in multi-agent reinforcement learning (MARL). Current credit assignment methods usually assume synchronous decision-making amo
Externí odkaz:
http://arxiv.org/abs/2408.03692
We study the Boltzmann equation with hard sphere in a near-equilibrium setting. The initial data is compactly supported in the space variable and has a polynomial tail in the microscopic velocity. We show that the solution can be decomposed into a pa
Externí odkaz:
http://arxiv.org/abs/2408.02183
Autor:
Brewer, Bruce W., Wang, Haitao
Let $V$ be a set of $n$ points in the plane. The unit-disk graph $G = (V, E)$ has vertex set $V$ and an edge $e_{uv} \in E$ between vertices $u, v \in V$ if the Euclidean distance between $u$ and $v$ is at most 1. The weight of each edge $e_{uv}$ is
Externí odkaz:
http://arxiv.org/abs/2407.03176
Autor:
Liu, Gang, Wang, Haitao
Given a set $P$ of $n$ points and a set $S$ of $m$ disks in the plane, the disk hitting set problem asks for a smallest subset of $P$ such that every disk of $S$ contains at least one point in the subset. The problem is NP-hard. In this paper, we con
Externí odkaz:
http://arxiv.org/abs/2407.00331
Autor:
Liu, Gang, Wang, Haitao
Given a set $P$ of $n$ points and a set $S$ of $n$ weighted disks in the plane, the disk coverage problem is to compute a subset of disks of smallest total weight such that the union of the disks in the subset covers all points of $P$. The problem is
Externí odkaz:
http://arxiv.org/abs/2407.00329
Autor:
Yang, Boyang, Tian, Haoye, Pian, Weiguo, Yu, Haoran, Wang, Haitao, Klein, Jacques, Bissyandé, Tegawendé F., Jin, Shunfu
Program repair techniques offer cost-saving benefits for debugging within software development and programming education scenarios. With the proven effectiveness of Large Language Models (LLMs) in code-related tasks, researchers have explored their p
Externí odkaz:
http://arxiv.org/abs/2406.13972
We consider the planar dynamic convex hull problem. In the literature, solutions exist supporting the insertion and deletion of points in poly-logarithmic time and various queries on the convex hull of the current set of points in logarithmic time. I
Externí odkaz:
http://arxiv.org/abs/2403.05697
Radio telescopes produce visibility data about celestial objects, but these data are sparse and noisy. As a result, images created on raw visibility data are of low quality. Recent studies have used deep learning models to reconstruct visibility data
Externí odkaz:
http://arxiv.org/abs/2403.00897
Autor:
Wang, Haitao, Xue, Jie
Given in the plane a set of points and a set of halfplanes, we consider the problem of computing a smallest subset of halfplanes whose union covers all points. In this paper, we present an $O(n^{4/3}\log^{5/3}n\log^{O(1)}\log n)$-time algorithm for t
Externí odkaz:
http://arxiv.org/abs/2402.16323