![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Weixiang Wang
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Zeinab S. Jalali
, Qilan Chen
, Shwetha Koushik Manchinahalli Srikanta
, Weixiang Wang
, Myunghwan Kim
, Hema Raghavan
, Sucheta Soundarajan
:
Fairness of Information Flow in Social Networks. ACM Trans. Knowl. Discov. Data 17(6): 79:1-79:26 (2023) - [c9]Sixian Chan, Weixiang Wang, Zhanpeng Shao, Cong Bai:
SGPT: The Secondary Path Guides the Primary Path in Transformers for HOI Detection. ICRA 2023: 7583-7590 - [c8]Weixiang Wang
, Sucheta Soundarajan
:
Fair Link Prediction with Multi-Armed Bandit Algorithms. WebSci 2023: 219-228 - 2022
- [j5]Wenhao Bi
, Junwen Ma, Xudong Zhu, Weixiang Wang, An Zhang:
Cloud service selection based on weighted KD tree nearest neighbor search. Appl. Soft Comput. 131: 109780 (2022) - 2020
- [c7]Zeinab S. Jalali, Weixiang Wang, Myunghwan Kim, Hema Raghavan, Sucheta Soundarajan:
On the Information Unfairness of Social Networks. SDM 2020: 613-521
2010 – 2019
- 2014
- [c6]Weixiang Wang, Youlin Shang, Ying Zhang:
A One-Parameter Filled Function Method Applied to Nonlinear Equations. CSO 2014: 271-274 - 2013
- [j4]Weixiang Wang, Youlin Shang, Liansheng Zhang, Ying Zhang:
Global minimization of non-smooth unconstrained problems with filled function. Optim. Lett. 7(3): 435-446 (2013) - 2012
- [j3]Weixiang Wang, Youlin Shang, Ying Zhang:
Finding global minima with a novel filled function for non-smooth unconstrained optimisation. Int. J. Syst. Sci. 43(4): 707-714 (2012) - [c5]Weixiang Wang, Youlin Shang:
A Quasi-filled Function Approach for Nonlinear Global Integer Optimization. CSO 2012: 359-361 - 2010
- [c4]Weixiang Wang, Youlin Shang:
Finding Global Minima with a Computable Quasi-filled Function for Constrained Global Optimization. APWCS 2010: 24-27
2000 – 2009
- 2009
- [j2]Weixiang Wang, Youlin Shang:
A New T-F Function Approach for Discrete Global Optimization. J. Comput. 4(3): 179-183 (2009) - [c3]Weixiang Wang, Youlin Shang:
A FFACGO for Constrained Global Optimization. JCAI 2009: 821-824 - 2008
- [c2]Weixiang Wang, Youlin Shang:
A Transformation Function for Finding Better Minima. ISIP 2008: 753-757 - [c1]Weixiang Wang, Youlin Shang:
An Algorithm for Rn Constrained Global Optimization Based on Filled Function Method. WKDD 2008: 654-657 - 2007
- [j1]Weixiang Wang, Youlin Shang, Liansheng Zhang:
A filled function method with one parameter for box constrained global optimization. Appl. Math. Comput. 194(1): 54-66 (2007)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-18 21:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint