default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun Hu 0008
Person information
- affiliation (PhD 2012): Université de technologie de Belfort-Montbéliard, France
Other persons with the same name
- Jun Hu — disambiguation page
- Jun Hu 0001
![[0000-0003-2714-6264]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-2714-6264")
— Eindhoven University of Technology, Department of Industrial Design, The Netherlands - Jun Hu 0002 — Chongqing University of Posts and Telecommunications, Chongqing Key Laboratory of Computational Intelligence, China (and 1 more)
- Jun Hu 0003 — National University of Defense Technology, College of Electronic Science, Changsha, China
- Jun Hu 0004 — Harbin University of Science and Technology, Department of Mathematics, China (and 3 more)
- Jun Hu 0005 — Central South University, School of Geosciences, Department of Surveying and Remote Sensing, Changsha, China (and 2 more)
- Jun Hu 0006 — Southeast University, State Key Laboratory of Millimeter Waves, Nanjing, China
- Jun Hu 0007 — NVIDIA, Santa Clara, CA, USA (and 1 more)
- Jun Hu 0009 — Hunan University, College of Computer Science and Electronic Engineering, China
- Jun Hu 0010 — Zhejiang University of Technology, College of Information Engineering, Hangzhou, China
- Jun Hu 0011 — University of Michigan, Department of Computational Medicine and Bioinformatics, Ann Arbor, MI, USA (and 1 more)
- Jun Hu 0012 — Tsinghua University, State Key Laboratory of Power Systems, Department of Electrical EngineeringBeijing, China
- Jun Hu 0013 — Peking University, School of Mathematical Sciences, Beijing, China
- Jun Hu 0014 — Parametrix.AI, Shenzhen, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2012
[b1]Jun Hu:
Algorithms for irreducible infeasible subset detection in CSP - Application to frequency planning and graph k-coloring. (Algorithmes pour la détection d'un sous ensemble irréalisable irréductible dans un CSP - Applications aux problèmes d'affectation des fréquences et problème de k-coloration). Université de technologie de Belfort-Montbéliard, France, 2012
Conference and Workshop Papers
- 2010
- [c1]Jun Hu, Philippe Galinier, Alexandre Caminada:
On Identifying Infeasible Subsets in Constraint Satisfaction Problems. IC-AI 2010: 615-619
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-09-15 00:44 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:
