default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTie-Jun Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j9]Jun-Feng Chen, Tie-Jun Wu:
A computational intelligence optimization algorithm: Cloud drops algorithm. Integr. Comput. Aided Eng. 21(2): 177-188 (2014)- 2012
- [j8]Shuang-Quan Wen, Tie-Jun Wu:
Computation for Maximum Stable Grasping in Dynamic Force Distribution. J. Intell. Robotic Syst. 68(3-4): 225-243 (2012) - [j7]Shuang-Quan Wen, Tie-Jun Wu:
Grasp evaluation and contact points planning for polyhedral objects using a ray-shooting algorithm. J. Zhejiang Univ. Sci. C 13(3): 218-231 (2012) - 2011
- [j6]Ying-Ying Chen, Tie-Jun Wu:
A decentralized coordination method for optimal load redistribution in heterogeneous service grids. Concurr. Comput. Pract. Exp. 23(6): 633-645 (2011) - [j5]Zongtao Li, Tie-Jun Wu, Can-Long Lin, Longhua Ma:
Field Programmable Gate Array Based Parallel Strapdown Algorithm Design for Strapdown Inertial Navigation Systems. Sensors 11(8): 7993-8017 (2011) - [j4]Qi Xuan, Fang Du, Yanjun Li, Tie-Jun Wu:
A Framework to Model the Topological Structure of Supply Networks. IEEE Trans Autom. Sci. Eng. 8(2): 442-446 (2011) - 2010
- [j3]Fang Du, Qi Xuan, Tie-Jun Wu:
One-to-Many Node Matching between Complex Networks. Adv. Complex Syst. 13(6): 725-739 (2010) - [j2]Cheng-gang Cui, Yan-jun Li, Tie-Jun Wu:
A relative feasibility degree based approach for constrained optimization problems. J. Zhejiang Univ. Sci. C 11(4): 249-260 (2010) - [c12]Fang Du, Yanjun Li, Tie-Jun Wu:
Regularized orthogonal forward feature selection for spectral data. IEEE ICCI 2010: 645-650 - [c11]Fang Du, Yanjun Li, Tie-Jun Wu:
Enhancing Particle Swarm Optimization via probabilistic models. IWACI 2010: 254-259
2000 – 2009
- 2006
- [j1]Wei-Qiang Xu, Tie-Jun Wu:
TCP Issues in Mobile Ad Hoc Networks: Challenges and Solutions. J. Comput. Sci. Technol. 21(1): 72-81 (2006) - [c10]Feng Yu, Yanjun Li, Tie-Jun Wu:
An Enhanced Heuristic Searching Algorithm for Complicated Constrained Optimization Problems. ICIC (1) 2006: 889-894 - 2003
- [c9]Yanjun Li, Tie-Jun Wu, David J. Hill:
An accelerated ant colony algorithm for complex nonlinear system optimization. ISIC 2003: 709-713 - [c8]Xiao-Rong Wang, Tie-Jun Wu:
An ant colony optimization approach for no-wait flow-line batch scheduling with limited batch sizes. CDC 2003: 2959-2964 - [c7]Xiao-Rong Wang, Tie-Jun Wu:
The Ant(λ) ant colony optimization algorithm based on eligibility trace. SMC 2003: 4065-4070 - [c6]Yu Wen, Tie-Jun Wu:
Dynamic window search of ant colony optimization for complex multi-stage decision problems. SMC 2003: 4091-4097 - [c5]Xiao-Rong Wang, Tie-Jun Wu:
A normalized minimum cross-entropy pheromone updating rule for ACO algorithm. SMC 2003: 4159-4164 - 2002
- [c4]Ni Zhang, Tie-Jun Wu:
Guaranteed performance control for uncertain impulsive hybrid systems and its application. ACC 2002: 704-709 - [c3]Yanjun Li, Tie-Jun Wu:
A nested ant colony algorithm for hybrid production scheduling. ACC 2002: 1123-1128 - [c2]Bin Han, Tie-Jun Wu:
Information entropy based reduct searching algorithm. ACC 2002: 4577-4582 - 2001
- [c1]Bin Han, Tie-Jun Wu:
Data mining in multisensor system based on rough set theory. ACC 2001: 4427-4431
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-09-05 23:43 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:
