default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTsu-Shuan Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j11]Min Chen, Tsu-Shuan Chang:
On the Higher-Order Method for the Solution of a Nonlinear Scalar Equation. J. Optim. Theory Appl. 149(3): 647-664 (2011)
2000 – 2009
- 2008
- [c1]Tsu-Shuan Chang, Manish Kumar, Teng-Sheng Moh, Chung-Li Tseng:
On the Feasibility of Obtaining a Globally Optimal Floorplanning for an L-shaped Layout Problem. ISQED 2008: 277-282 - 2003
- [j10]Teng-Sheng Moh, Tsu-Shuan Chang:
Comments on "Handling soft modules in general nonslicing floorplan using Lagrangian relaxation". IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(12): 1684-1686 (2003)
1990 – 1999
- 1998
- [j9]Xiaojun Wang, Tsu-Shuan Chang:
A Multivariate Global Optimization Using Linear Bounding Functions. J. Glob. Optim. 12(4): 383-404 (1998) - 1996
- [j8]Xiaojun Wang, Tsu-Shuan Chang:
An improved univariate global optimization algorithm with improved linear lower bounding functions. J. Glob. Optim. 8(4): 393-411 (1996) - 1995
- [j7]Tsung-Rian Chen, Tsu-Shuan Chang, Cheng-Wu Chen, Jen Kao:
Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation. IEEE Trans. Syst. Man Cybern. 25(8): 1249-1256 (1995) - [j6]Mao Yu, Tsu-Shuan Chang:
An adaptive step size for backpropagation using linear lower bounding functions. IEEE Trans. Signal Process. 43(5): 1243-1248 (1995) - 1992
- [j5]Tsu-Shuan Chang, Khaled A. S. Abdel-Ghaffar:
A universal neural net with guaranteed convergence to zero system error. IEEE Trans. Signal Process. 40(12): 3022-3031 (1992) - 1990
- [j4]Yu-Chung Liao, Tsu-Shuan Chang:
An Approximate Solution for Computer Networks with Semaphores. Perform. Evaluation 11(2): 143-151 (1990)
1980 – 1989
- 1989
- [j3]Shi-Chung Chang
, Tsu-Shuan Chang, Peter B. Luh:
A hierarchical decomposition for large-scale optimal control problems with parallel processing structure. Autom. 25(1): 77-86 (1989) - 1986
- [j2]Tsu-Shuan Chang, Yu-Chi Ho:
A bound for a class of non-nested LQG team problems. Autom. 22(3): 377-379 (1986) - 1984
- [j1]Peter B. Luh, Shi-Chung Chang, Tsu-Shuan Chang:
Solutions and properties of multi-stage stackelberg games. Autom. 20(2): 251-256 (1984)
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:49 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:
