default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHong Xu 0003
Person information
- unicode name: 許弘
- affiliation (former): IBM, San Francisco, CA, USA
- affiliation (former): University of Southern California, Los Angeles, CA, USA
Other persons with the same name
- Hong Xu — disambiguation page
- Hong Xu 0001
![[0000-0002-9359-9571]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9359-9571")
(aka: Henry Hong Xu) — The Chinese University of Hong Kong, Hong Kong (and 2 more) - Hong Xu 0002 — Duke University Medical Center, Durham, NC, USA
- Hong Xu 0004 — Nanyang Technological University, Division of Psychology, Singapore (and 2 more)
- Hong Xu 0005 — Cisco Systems, Inc., San Jose, CA, USA (and 1 more)
- Hong Xu 0006 — Université libre de Bruxelles, Brussels, Belgium
- Hong Xu 0007 — Wuyi University, China (and 1 more)
- Hong Xu 0008 — Information Engineering University, Zhengzhou, China
- Hong Xu 0009 — Beijing University of Posts and Telecommunications, Beijing, China
- Hong Xu 0010 — Xidian University, Hangzhou, China (and 1 more)
- Hong Xu 0011 — Zhejiang University of Technology, Hangzhou, Zhejiang, China
- Hong Xu 0012 — University of Utah, Salt Lake City, UT, USA
- Hong Xu 0013 — Katholieke Universiteit Leuven, Heverlee, Belgium
- Hong Xu 0014 — Hangzhou Dianzi University, Hangzhou, Zhejiang, China (and 1 more)
- Hong Xu 0015 — Hong Kong University of Science and Technology, Hong Kong
- Hong Xu 0016 — Medical University of Vienna, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c26]Kexuan Sun, Shudan Zhong, Hong Xu:
Learning Embeddings of Directed Networks with Text-Associated Nodes - with Application in Software Package Dependency Networks. IEEE BigData 2020: 2995-3004- [c25]Frederick Reiss, Hong Xu, Bryan Cutler, Karthik Muthuraman, Zachary Eichenberger:
Identifying Incorrect Labels in the CoNLL-2003 Corpus. CoNLL 2020: 215-226 - [c24]Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar:
Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. ISAIM 2020 - [c23]Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. SOCS 2020: 91-99
2010 – 2019
- 2019
- [c22]Alex Bozarth, Brendan Dwyer, Fei Hu, Daniel Jalova, Karthik Muthuraman, Nick Pentreath, Simon Plovyt, Gabriela de Queiroz, Saishruthi Swaminathan, Patrick Titzler, Xin Wu, Hong Xu, Frederick R. Reiss, Vijay Bommireddipalli:
Model Asset eXchange: Path to Ubiquitous Deep Learning Deployment. CIKM 2019: 2953-2956 - [c21]Ka Wa Yip, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. CPAIOR 2019: 643-660 - [c20]Shudan Zhong, Hong Xu:
Intelligently recommending key bindings on physical keyboards with demonstrations in Emacs. IUI 2019: 12-17 - [i5]Alex Bozarth, Brendan Dwyer, Fei Hu, Daniel Jalova, Karthik Muthuraman, Nick Pentreath, Simon Plovyt, Gabriela de Queiroz, Saishruthi Swaminathan, Patrick Titzler, Xin Wu, Hong Xu, Frederick R. Reiss, Vijay Bommireddipalli:
Model Asset eXchange: Path to Ubiquitous Deep Learning Deployment. CoRR abs/1909.01606 (2019) - 2018
- [c19]Hong Xu, Sven Koenig, T. K. Satish Kumar:
Towards Effective Deep Learning for Constraint Satisfaction Problems. CP 2018: 588-597 - [c18]Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. CPAIOR 2018: 567-584 - [c17]T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock:
Alert Generation in Execution Monitoring Using Resource Envelopes. FLAIRS 2018: 38-43 - [c16]Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar:
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. ISAIM 2018 - [c15]Hong Xu, Xin-Zeng Wu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar:
The Buss Reduction for the k-Weighted Vertex Cover Problem. ISAIM 2018 - [c14]Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. ISAIM 2018 - [c13]Masaru Nakajima, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach. ISAIM 2018 - [c12]Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar:
Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph. PRIMA 2018: 106-122 - [c11]Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar:
Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. SOCS 2018: 115-123 - [i4]Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems. CoRR abs/1804.00038 (2018) - [i3]Shudan Zhong, Hong Xu:
Learning Embeddings of Directed Networks with Text-Associated Nodes - with Applications in Software Package Dependency Networks. CoRR abs/1809.02270 (2018) - 2017
- [j1]Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems. IEEE Intell. Syst. 32(6): 6-12 (2017) - [c10]Hong Xu, T. K. Satish Kumar, Sven Koenig:
Min-Max Message Passing and Local Consistency in Constraint Networks. Australasian Conference on Artificial Intelligence 2017: 340-352 - [c9]Hong Xu, Sven Koenig, T. K. Satish Kumar:
A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP. CP 2017: 630-638 - [c8]Hong Xu, T. K. Satish Kumar, Sven Koenig:
The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. CPAIOR 2017: 387-402 - [c7]T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock:
A Distributed Logical Filter for Connected Row Convex Constraints. ICTAI 2017: 96-101 - [c6]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Summary: Multi-Agent Path Finding with Kinematic Constraints. IJCAI 2017: 4869-4873 - [c5]Hong Xu, T. K. Satish Kumar, Sven Koenig:
A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. SOCS 2017: 173-174 - [i2]Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hönig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig A. Tovey, Guni Sharon:
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios. CoRR abs/1702.05515 (2017) - [i1]Therese Anders, Hong Xu, Cheng Cheng, T. K. Satish Kumar:
Measuring Territorial Control in Civil Wars Using Hidden Markov Models: A Data Informatics-Based Approach. CoRR abs/1711.06786 (2017) - 2016
- [c4]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Multi-Agent Path Finding with Kinematic Constraints. ICAPS 2016: 477-485 - [c3]Hong Xu, T. K. Satish Kumar, Sven Koenig:
A New Solver for the Minimum Weighted Vertex Cover Problem. CPAIOR 2016: 392-405 - [c2]Hong Xu, T. K. Satish Kumar, Dylan Johnke, Nora Ayanian, Sven Koenig:
SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks. ICTAI 2016: 530-535 - [c1]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, Sven Koenig:
Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. IJCAI 2016: 3067-3074
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
