Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Wennan Zhu"'
Publikováno v:
Handbook of Dynamic Data Driven Applications Systems ISBN: 9783030745677
Handbook of Dynamic Data Driven Applications Systems ISBN: 9783319955032
Handbook of Dynamic Data Driven Applications Systems
Handbook of Dynamic Data Driven Applications Systems ISBN: 9783319955032
Handbook of Dynamic Data Driven Applications Systems
Spatio-temporal data streams are often related in complex ways, for example, while the airspeed that an aircraft attains in cruise phase depends on the weight it carries, it also depends on many other factors. Some of these factors are controllable s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74abf750473a2ddec4d0d6ff5d823da2
https://doi.org/10.1007/978-3-030-74568-4_5
https://doi.org/10.1007/978-3-030-74568-4_5
Forming better stable solutions in Group Formation Games inspired by Internet Exchange Points (IXPs)
Autor:
Elliot Anshelevich, Wennan Zhu
We study a coordination game motivated by the formation of Internet Exchange Points (IXPs), in which agents choose which facilities to join. Joining the same facility as other agents you communicate with has benefits, but different facilities have di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07760c1f09c3f368a3140ee0a3f76d6e
Publikováno v:
Cluster Computing. 22:2187-2210
In sensor-based systems, spatio-temporal data streams are often related in non-trivial ways. For example in avionics, while the airspeed that an aircraft attains in cruise phase depends on the weight it carries, it also depends on many other factors
Publikováno v:
IEEE Aerospace and Electronic Systems Magazine. 32:4-17
Ubiquitous sensing is pervasive in society for such applications as biometrics for health care, smart grids for power delivery, and avionics for transportation safety [1]. As society continues to rely ever more on sensors for various applications, th
Publikováno v:
Web and Internet Economics ISBN: 9783030353889
WINE
WINE
We develop new voting mechanisms for the case where voters and candidates are located in an arbitrary unknown metric space, and the goal is to choose a candidate minimizing social cost: the total distance of the voters to this candidate. Previous wor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fd7f27bb26b62f582ecbfea6a691c68
https://doi.org/10.1007/978-3-030-35389-6_1
https://doi.org/10.1007/978-3-030-35389-6_1
Autor:
Elliot Anshelevich, Wennan Zhu
In this work, we consider general facility location and social choice problems, in which sets of agents A and facilities F are located in a metric space, and our goal is to assign agents to facilities (as well as choose which facilities to open) to o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::649adadaf404131c06ca2990046f365c
http://arxiv.org/abs/1805.03103
http://arxiv.org/abs/1805.03103
Autor:
Elliot Anshelevich, Wennan Zhu
Publikováno v:
Web and Internet Economics ISBN: 9783030046118
WINE
WINE
In this work we consider general facility location and social choice problems, in which sets of agents \(\mathcal {A}\) and facilities \(\mathcal {F}\) are located in a metric space, and our goal is to assign agents to facilities (as well as choose w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1b1c435531c965c14e5bfa1f3a3f110
https://doi.org/10.1007/978-3-030-04612-5_1
https://doi.org/10.1007/978-3-030-04612-5_1
Autor:
Elliot Anshelevich, Wennan Zhu
We study ordinal approximation algorithms for maximum-weight bipartite matchings. Such algorithms only know the ordinal preferences of the agents/nodes in the graph for their preferred matches, but must compete with fully omniscient algorithms which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07f16eac742b096002a9ac5ed49b1667
Autor:
Wennan Zhu, Elliot Anshelevich
Publikováno v:
Algorithmic Game Theory ISBN: 9783319666990
SAGT
SAGT
We study ordinal approximation algorithms for maximum-weight bipartite matchings. Such algorithms only know the ordinal preferences of the agents/nodes in the graph for their preferred matches, but must compete with fully omniscient algorithms which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15cc91ac72f297cb29144b14b38d6d1c
https://doi.org/10.1007/978-3-319-66700-3_21
https://doi.org/10.1007/978-3-319-66700-3_21
Autor:
Xiang Lv, Chao Zeng, Feng Chen, De-Pei Liu, Chih-Chuan Liang, Zhi-Chen Guo, Lei Feng, Zhen-Ya Li, Zhu-Qin Zhang, Guang Liu, Wennan Zhu, Yang Xi, De-Long Hao, Hou-Zao Chen
Publikováno v:
Journal of hepatology. 55(3)
Background & Aims miR-122 is the most abundant microRNA in the liver and regulates metabolic pathways including cholesterol biosynthesis, fatty acid synthesis, and oxidation. However, little is known about mechanisms that regulate the expression of m