default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTian-Ming Bu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Liyun Xiao, Tian-Ming Bu, Jiangtao Wang:
A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology. Comput. Aided Des. 175: 103736 (2024)- 2022
- [c13]Ning Xu, Tian-Ming Bu:
Policy network for solving flexible job shop scheduling problem with setup times and rescoure constraints. GECCO Companion 2022: 208-211 - 2021
- [j10]Fan Zhang
, Tian-Ming Bu:
CN-Motifs Perceptive Graph Neural Networks. IEEE Access 9: 151285-151293 (2021) - [c12]Kang Shi, Tian-Ming Bu:
A method for generating various style Chinese fonts in the absence of training data (S). SEKE 2021: 470-474 - [c11]Sunfei Ye, Tian-Ming Bu:
A Self-learning Harris Hawks Optimization Algorithm for Flexible Job Shop Scheduling with Setup Times and Resource Constraints. SMC 2021: 2642-2649
2010 – 2019
- 2019
- [c10]Jiehui Pan, Tian-Ming Bu:
A Fast Greedy Algorithm for Finding Minimum Positive Influence Dominating Sets in Social Networks. INFOCOM Workshops 2019: 360-364 - 2018
- [j9]Hengyang Wu, Yixiang Chen, Tian-Ming Bu, Yuxin Deng:
Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems. Fuzzy Sets Syst. 333: 106-123 (2018) - 2017
- [c9]Tian-Ming Bu, Hengyang Wu, Yixiang Chen:
Computing behavioural distance for fuzzy transition systems. TASE 2017: 1-7 - 2016
- [r6]Tian-Ming Bu:
Adwords Pricing. Encyclopedia of Algorithms 2016: 24-27 - [r5]Tian-Ming Bu:
Competitive Auction. Encyclopedia of Algorithms 2016: 364-366 - [r4]Tian-Ming Bu:
Multiple Unit Auctions with Budget Constraint. Encyclopedia of Algorithms 2016: 1382-1383 - 2015
- [j8]Tian-Ming Bu, Chen Yuan, Peng Zhang:
Computing on binary strings. Theor. Comput. Sci. 562: 122-128 (2015) - 2013
- [c8]Jie Zhou, Tian-Ming Bu, Hong Zhu, Yixiang Chen:
Vehicle Scheduling Problem on Trees. BIC-TA 2013: 535-541 - 2012
- [j7]Tian-Ming Bu, Xiaotie Deng, Qi Qi:
Multi-bidding strategy in sponsored search auctions. J. Comb. Optim. 23(3): 356-372 (2012) - 2011
- [i1]Tian-Ming Bu, Chen Yuan, Peng Zhang:
Computing on Binary Strings. CoRR abs/1112.0278 (2011) - 2010
- [j6]Tian-Ming Bu, Li Liang, Qi Qi:
On Robustness of Forward-looking in Sponsored Search Auction. Algorithmica 58(4): 970-989 (2010)
2000 – 2009
- 2009
- [c7]Yixiang Chen, Tian-Ming Bu, Min Zhang, Hong Zhu:
Max-Minimum Algorithm for Trust Transitivity in Trustworthy Networks. Web Intelligence/IAT Workshops 2009: 62-64 - [c6]Yixiang Chen, Min Zhang, Hong Zhu, Tian-Ming Bu:
Average Transitive Trustworthy Degrees for Trustworthy Networks. RSKT 2009: 682-689 - 2008
- [j5]Tian-Ming Bu, Xiaotie Deng, Qi Qi:
Forward looking Nash equilibrium for keyword auction. Inf. Process. Lett. 105(2): 41-46 (2008) - [j4]Tian-Ming Bu, Qi Qi, Aries Wei Sun:
Unconditional competitive auctions with copy and budget constraints. Theor. Comput. Sci. 393(1-3): 1-13 (2008) - [j3]Tian-Ming Bu, Xiaotie Deng, Qi Qi:
Arbitrage opportunities across sponsored search markets. Theor. Comput. Sci. 407(1-3): 182-191 (2008) - [c5]Tian-Ming Bu, Xiaotie Deng, Qi Qi:
Multi-bidding Strategy in Sponsored Keyword Auction. FAW 2008: 124-134 - [c4]Tian-Ming Bu, Xiaotie Deng, Qianya Lin, Qi Qi:
Strategies in Dynamic Pari-Mutual Markets. WINE 2008: 138-153 - [r3]Tian-Ming Bu:
Adwords Pricing. Encyclopedia of Algorithms 2008 - [r2]Tian-Ming Bu:
Competitive Auction. Encyclopedia of Algorithms 2008 - [r1]Tian-Ming Bu:
Multiple Unit Auctions with Budget Constraint. Encyclopedia of Algorithms 2008 - 2006
- [j2]Zheng Sun, Tian-Ming Bu:
On discretization methods for approximating optimal paths in regions with direction-dependent costs. Inf. Process. Lett. 97(4): 146-152 (2006) - [c3]Tian-Ming Bu, Qi Qi, Aries Wei Sun:
Unconditional Competitive Auctions with Copy and Budget Constraints. WINE 2006: 16-26 - 2005
- [c2]Tian-Ming Bu, Zhen-Jian Li, Zheng Sun:
Adaptive and relaxed visibility-based PRM. ROBIO 2005: 174-179 - [c1]Zheng Sun, Tian-Ming Bu, Li-fen Zhang:
On discretization methods for generalized weighted region shortest path problems. ROBIO 2005: 180-185 - 2004
- [j1]Tian-Ming Bu, Song-Nian Yu, Hui-Wei Guan:
Binary-Coding-Based Ant Colony Optimization and Its Convergence. J. Comput. Sci. Technol. 19(4): 472-478 (2004)
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-07-01 21:31 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:
