default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTian-Li Yu 0001
Person information
- affiliation: National Taiwan University, Taipei, Taiwan
Other persons with the same name
- Tian-Li Yu (aka: Tianli Yu) — disambiguation page
- Tian-Li Yu 0002 — Like.com, San Mateo, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c59]Tu-Chin Chiang, Chi-Hsien Chang, Tian-Li Yu:
A Novel Symbolic Regressor Enhancer Using Genetic Programming. CEC 2024: 1-8- [c58]Tzu-Hao Hsu, Chi-Hsien Chang, Tian-Li Yu:
Program Synthesis on Single-Layer Loop Behavior in Pure Functional Programming. CEC 2024: 1-8 - [c57]Jung-Chun Liu, Chi-Hsien Chang, Shao-Hua Sun, Tian-Li Yu:
Integrating Planning and Deep Reinforcement Learning via Automatic Induction of Task Substructures. ICLR 2024 - 2023
- [c56]Bo-Wei Huang
, Wen Zhong Fang, Hsu Chen Liao, Tian-Li Yu:
Relational Bayesian Optimization for Permutation. GECCO Companion 2023: 471-474 - [c55]Chi-Hsien Chang, Tu-Chin Chiang, Tzu-Hao Hsu, Ting-Shuo Chuang, Wen Zhong Fang, Tian-Li Yu:
Taylor Polynomial Enhancer using Genetic Programming for Symbolic Regression. GECCO Companion 2023: 543-546 - [c54]Wen Zhong Fang, Chi-Hsien Chang, Jung-Chun Liu, Tian-Li Yu:
GP with Ranging-Binding Technique for Symbolic Regression. GECCO Companion 2023: 563-566 - [c53]Hsu Chen Liao, Wen Zhong Fang, Tian-Li Yu:
Adaptive Donor Selection Mixing for Multi-objective Optimization: an Enhanced Variant of MO-GOMEA. GECCO 2023: 695-703 - 2022
- [c52]Ching-Chung Huang, Tian-Li Yu:
Trimming, ordering, and similarity check for DSMGA-II: DSMGA-II-TOS. GECCO Companion 2022: 435-438 - [c51]Chi-Meng Ngai, Tian-Li Yu:
Improving DSMGA-II performance on hierarchical problems by introducing preservative back mixing. GECCO Companion 2022: 455-458 - [c50]Liang-Jung Huang, Tian-Li Yu:
TAGA: a transfer-based black-box adversarial attack with genetic algorithms. GECCO 2022: 712-720 - 2021
- [c49]Kei Ohnishi, Daiki Koga, Tian-Li Yu:
Test Problem in Which Bits Used for Fitness Calculation Depend on Bit Pattern. SSCI 2021: 1-9 - 2020
- [c48]Jhih-Wei Chen, Ming-Chun Lu, Tian-Li Yu:
Continuous optimization by hierarchical gaussian mixture with clustering embedded resource allocation. GECCO Companion 2020: 191-192 - [c47]Kei Ohnishi, Shota Ikeda, Tian-Li Yu:
A test problem with difficulty in decomposing into sub-problems for model-based genetic algorithms. GECCO Companion 2020: 221-222
2010 – 2019
- 2019
- [c46]Cheng-Hao Yang, Hou-Teng Cheong, Tian-Li Yu:
Comparison of GAs in black-box scenarios. GECCO (Companion) 2019: 310-311 - [c45]Yi-Yun Liao, Hung-Wei Hsu, Yi-Lin Juang, Tian-Li Yu:
On the investigation of population sizing of genetic algorithms using optimal mixing. GECCO 2019: 820-828 - [c44]Kei Ohnishi, Tomohiro Yoshikawa, Tian-Li Yu:
An intuitive and traceable human-based evolutionary computation system for solving problems in human organizations. GECCO (Companion) 2019: 1457-1464 - 2018
- [c43]Chia-Sheng Chen, Hung-Wei Hsu, Tian-Li Yu:
Fast algorithm for fair comparison of genetic algorithms. GECCO 2018: 913-920 - [c42]Yuen-Jen Lin, Tian-Li Yu:
Investigation of the exponential population scheme for genetic algorithms. GECCO 2018: 975-982 - [i2]Yu-Fan Tung, Tian-Li Yu:
Theoretical Perspective of Convergence Complexity of Evolutionary Algorithms Adopting Optimal Mixing. CoRR abs/1807.09203 (2018) - [i1]Shih-Huan Hsu, Tian-Li Yu:
Optimization by Pairwise Linkage Detection, Incremental Linkage Set, and Restricted / Back Mixing: DSMGA-II. CoRR abs/1807.11669 (2018) - 2017
- [c41]Ping-Lin Chen, Chun-Jen Peng, Chang-Yi Lu, Tian-Li Yu:
Two-edge graphical linkage model for DSMGA-II. GECCO 2017: 745-752 - [c40]Sung-Chi Li, Tian-Li Yu:
Speeding up DSMGA-II on CUDA platform. GECCO 2017: 809-816 - [c39]Jheng-Ying Yu, I-Ting Chen, Tian-Li Yu:
A diversity preservation scheme for DSMGA-II to conquer the hierarchical difficulty. GECCO 2017: 841-848 - 2016
- [c38]Chia-hua Chang, Tian-Li Yu:
Investigation on Parameterless Schemes for DSMGA-II. GECCO (Companion) 2016: 85-86 - 2015
- [c37]Shih-Huan Hsu, Tian-Li Yu:
Optimization by Pairwise Linkage Detection, Incremental Linkage Set, and Restricted / Back Mixing: DSMGA-II. GECCO 2015: 519-526 - [c36]Yu-Fan Tung, Tian-Li Yu:
Theoretical Perspective of Convergence Complexity of Evolutionary Algorithms Adopting Optimal Mixing. GECCO 2015: 535-542 - 2014
- [c35]Hsiao-Yu Tung, Wei-Chiu Ma, Tian-Li Yu:
Novel traffic signal timing adjustment strategy based on Genetic Algorithm. IEEE Congress on Evolutionary Computation 2014: 2353-2360 - [c34]Shih-Ming Wang, Yu-Fan Tung, Tian-Li Yu:
Investigation on efficiency of optimal mixing on various linkage sets. IEEE Congress on Evolutionary Computation 2014: 2475-2482 - [c33]Yi-En Su, Tian-Li Yu:
Use model building on discretization algorithms for discrete EDAs To work on real-valued problems. IEEE Congress on Evolutionary Computation 2014: 2491-2498 - 2013
- [j3]Kai-Chun Fan, Tian-Li Yu, Jui-Ting Lee:
Linkage learning by number of function evaluations estimation: Practical view of building blocks. Inf. Sci. 230: 162-182 (2013) - [c32]Wei-Ming Chen, Chu-Yu Hsu, Tian-Li Yu, Wei-Che Chien:
Effects of discrete hill climbing on model building forestimation of distribution algorithms. GECCO 2013: 367-374 - [c31]Po-Chun Hsu, Tian-Li Yu:
A niching scheme for EDAs to reduce spurious dependencies. GECCO 2013: 375-382 - [c30]Shih-Ming Wang, Jie-Wei Wu, Wei-Ming Chen, Tian-Li Yu:
Design of test problems for discrete estimation of distribution algorithms. GECCO 2013: 407-414 - [c29]Chih-Yuan Chou, Tian-Li Yu:
Using representative strategies for finding nash equilibria. GECCO 2013: 1133-1140 - [c28]Chung-Yu Shao, Tian-Li Yu:
Speeding up model building for ECGA on CUDA platform. GECCO 2013: 1197-1204 - 2012
- [c27]Wei-Ming Chen, Chung-Yu Shao, Po-Chun Hsu, Tian-Li Yu:
A test problem with adjustable degrees of overlap and conflict among subproblems. GECCO 2012: 257-264 - [c26]Hsuan Lee, Tian-Li Yu:
Off-line building block identification: detecting building blocks directly from fitness without genetic algorithms. GECCO 2012: 641-648 - [c25]Tsung-Yu Ho, Tian-Li Yu:
A linkage-learning niching in estimation of distribution algorithm. GECCO (Companion) 2012: 649-650 - [c24]Chung-Hsiang Hsueh, Tian-Li Yu:
Affective content based music video paring system using real coded GA. GECCO (Companion) 2012: 1427-1428 - 2011
- [c23]Luca Bertelli, Tian-Li Yu, Diem Vu, Burak Gokturk:
Kernelized structural SVM learning for supervised object segmentation. CVPR 2011: 2153-2160 - [c22]Jen-Hao Chang, Chung-Hsiang Hsueh, Hsuan Lee, Tian-Li Yu, Tsung-Yu Ho:
A test function with full controllability over overlapping: estimation of distribution algorithms. GECCO (Companion) 2011: 61-62 - [c21]Kai-Chun Fan, Tian-Li Yu, Jui-Ting Lee:
Interaction detection by NFE estimation: a practical view of building blocks. GECCO (Companion) 2011: 71-72 - [c20]Jui-Ting Lee, Kai-Chun Fan, Tian-Li Yu:
The essence of real-valued characteristic function for pairwise relation in linkage learning for EDAs. GECCO 2011: 569-576 - 2010
- [c19]Kai-Chun Fan, Jui-Ting Lee, Tian-Li Yu, Tsung-Yu Ho:
Interaction-detection metric with differential mutual complement for dependency structure matrix genetic algorithm. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c18]Orhan Çamoglu, Tian-Li Yu, Luca Bertelli, Diem Vu, Muralidharan V, Salih Gokturk:
An efficient fashion-driven learning approach to model user preferences in on-line shopping scenarios. CVPR Workshops 2010: 28-34 - [c17]Ta-Chun Lien, Tian-Li Yu, Ying-Shiuan You:
Co-evolution of cooperative strategies under egoism. GECCO 2010: 697-704 - [c16]Ying-Shiuan You, Tian-Li Yu, Ta-Chun Lien:
Psychological preference-based optimization framework on the nurse scheduling problem. GECCO 2010: 1319-1320
2000 – 2009
- 2009
- [j2]Tian-Li Yu, David E. Goldberg, Kumara Sastry, Cláudio F. Lima, Martin Pelikan:
Dependency Structure Matrix, Genetic Algorithms, and Effective Recombination. Evol. Comput. 17(4): 595-626 (2009) - [c15]Si-Cheng Chen, Tian-Li Yu:
Difficulty of linkage learning in estimation of distribution algorithms. GECCO 2009: 397-404 - [c14]Wei-Kai Lin, Tian-Li Yu:
Co-evolvability of games in coevolutionary genetic algorithms. GECCO 2009: 1869-1870 - 2008
- [c13]Tian-Li Yu, Wei-Kai Lin:
Optimal sampling of genetic algorithms on polynomial regression. GECCO 2008: 1089-1096 - [c12]Yong Wang, Tian-Li Yu, Larry Shi, Zhu Li:
Using human body gestures as inputs for gaming via depth analysis. ICME 2008: 993-996 - [p3]Minqiang Li, David E. Goldberg, Kumara Sastry, Tian-Li Yu:
Real-Coded ECGA for Solving Decomposable Real-Valued Optimization Problems. Linkage in Evolutionary Computation 2008: 61-86 - 2007
- [c11]Minqiang Li, David E. Goldberg, Kumara Sastry, Tian-Li Yu:
Real-coded ECGA for solving decomposable real-valued optimization problems. IEEE Congress on Evolutionary Computation 2007: 2194-2201 - [c10]Tian-Li Yu, Kumara Sastry, David E. Goldberg, Martin Pelikan:
Population sizing for entropy-based model building in discrete estimation of distribution algorithms. GECCO 2007: 601-608 - [c9]Xavier Llorà, Kumara Sastry, Tian-Li Yu, David E. Goldberg:
Do not match, inherit: fitness surrogates for genetics-based machine learning techniques. GECCO 2007: 1798-1805 - [c8]Minqiang Li, David E. Goldberg, Kumara Sastry, Tian-Li Yu:
Performance Analyses of Factorization Based on Gaussian PDF In rECGA. ICNC (4) 2007: 362-369 - [p2]Tian-Li Yu, Kumara Sastry, David E. Goldberg:
Population Sizing to Go: Online Adaptation Using Noise and Substructural Measurements. Parameter Setting in Evolutionary Algorithms 2007: 205-223 - 2006
- [b1]Tian-Li Yu:
A Matrix Approach for Finding Extrema: Problems With Modularity, Hierarchy, and Overlap. University of Illinois Urbana-Champaign, USA, 2006 - [j1]Scott Santarelli, Tian-Li Yu, David E. Goldberg, Edward E. Altshuler, Teresa O'Donnell, Hugh Southall, Robert Mailloux:
Military antenna design using simple and competent genetic algorithms. Math. Comput. Model. 43(9-10): 990-1022 (2006) - [c7]Tian-Li Yu, David E. Goldberg:
Conquering hierarchical difficulty by explicit chunking: substructural chromosome compression. GECCO 2006: 1385-1392 - [p1]Tian-Li Yu, Scott Santarelli, David E. Goldberg:
Military Antenna Design Using a Simple Genetic Algorithm and hBOA. Scalable Optimization via Probabilistic Modeling 2006: 275-289 - 2005
- [c6]Tian-Li Yu, Kumara Sastry, David E. Goldberg:
Online population size adjusting using noise and substructural measurements. Congress on Evolutionary Computation 2005: 2491-2498 - [c5]Tian-Li Yu, Kumara Sastry, David E. Goldberg:
Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination. GECCO 2005: 1217-1224 - 2004
- [c4]Tian-Li Yu, David E. Goldberg:
Dependency Structure Matrix Analysis: Offline Utility of the Dependency Structure Matrix Genetic Algorithm. GECCO (2) 2004: 355-366 - [c3]Tian-Li Yu, David E. Goldberg:
Toward an Understanding of the Quality and Efficiency of Model Building for Genetic Algorithms. GECCO (2) 2004: 367-378 - 2003
- [c2]Tian-Li Yu, David E. Goldberg, Kumara Sastry:
Optimal Sampling and Speed-Up for Genetic Algorithms on the Sampled OneMax Problem. GECCO 2003: 1554-1565 - [c1]Tian-Li Yu, David E. Goldberg, Ali Yassine, Ying-Ping Chen:
Genetic Algorithm Design Inspired by Organizational Theory: Pilot Study of a Dependency Structure Matrix Driven Genetic Algorithm. GECCO 2003: 1620-1621
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 2025-03-01 16:15 CET 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:
