default search action
S. Y. Wu
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c2]C. M. Wong, S. Y. Wu, W. H. Ting, K. H. Ho, L. H. Tong, N. T. Cheung:
An Electronic Nursing Patient Care Plan Helps in Clinical Decision Support. MedInfo 2015: 945 - 2013
- [j15]M. H. Rashid, S. H. Yu, C. Li, S. Y. Wu:
Convergence Analysis of the Gauss-Newton-Type Method for Lipschitz-Like Mappings. J. Optim. Theory Appl. 158(1): 216-233 (2013) - [j14]Ka Fai Cedric Yiu, Ming Jie Gao, T. J. Shiu, S. Y. Wu, T. Tran, I. Claesson:
A fast algorithm for the optimal design of high accuracy windows in signal processing. Optim. Methods Softw. 28(4): 900-916 (2013) - 2011
- [j13]J. W. Peng, S. Y. Wu:
The Well-Posedness for Multiobjective Generalized Games. J. Optim. Theory Appl. 150(2): 416-423 (2011)
2000 – 2009
- 2009
- [j12]Shengjie Li, C. R. Chen, S. Y. Wu:
Conjugate dual problems in constrained set-valued optimization and applications. Eur. J. Oper. Res. 196(1): 21-32 (2009) - [j11]N. J. Huang, J. Li, S. Y. Wu:
Optimality Conditions for Vector Optimization Problems. J. Optimization Theory and Applications 142(2): 323-342 (2009) - 2008
- [c1]Hsiau-Hsian Nien, S. K. Changchien, S. Y. Wu, C. K. Huang:
A new Pixel-Chaotic-Shuffle method for image encryption. ICARCV 2008: 883-887 - 2007
- [j10]Zhong Wan, S. Y. Wu, Kok Lay Teo:
Some properties on quadratic infinite programs of integral type. Appl. Math. Lett. 20(6): 676-680 (2007) - 2006
- [j9]Shengjie Li, Kok Lay Teo, Xiaoqi Yang, S. Y. Wu:
Gap Functions and Existence of Solutions to Generalized Vector Quasi-Equilibrium Problems. J. Glob. Optim. 34(3): 427-440 (2006) - 2004
- [j8]Y. Liu, Kok Lay Teo, S. Y. Wu:
A New Quadratic Semi-infinite Programming Algorithm Based on Dual Parametrization. J. Glob. Optim. 29(4): 401-413 (2004) - [j7]C. F. Wen, S. Y. Wu:
Duality theorems and algorithms for linear programming in measure spaces. J. Glob. Optim. 30(2-3): 207-233 (2004) - 2001
- [j6]S. Y. Wu:
A Cutting Plane Approach to Solving Quadratic Infinite Programs on Measure Spaces. J. Glob. Optim. 21(1): 67-87 (2001)
1990 – 1999
- 1997
- [j5]M. A. Do, S. Y. Wu:
Hybrid diversity combining techniques for DS-CDMA over a multipath fading channel. Wirel. Networks 3(2): 155-158 (1997) - 1992
- [j4]Chu-Sing Yang, S. Y. Wu, Wen-Shyong Hsieh, K. C. Huang:
A reconfigurable boolean n-cube architecture under faults. Microprocess. Microprogramming 35(1-5): 673-679 (1992) - [j3]H. C. Lai, S. Y. Wu:
Extremal points and optimal solutions for general capacity problems. Math. Program. 54: 87-113 (1992) - 1991
- [j2]C. S. Yang, S. Y. Wu, K. C. Huang:
A reconfigurable modular fault tolerant generalized Boolean n-cube network. Microprocessing and Microprogramming 32(1-5): 589-592 (1991)
1980 – 1989
- 1981
- [j1]D. Sculli, S. Y. Wu:
Block replacement for units whose components have weibul life distributions. Comput. Oper. Res. 8(4): 295-302 (1981)
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-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint