Tian-Ming Bu

Orcid: 0000-0002-4793-7023

According to our database1, Tian-Ming Bu authored at least 28 papers between 2004 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Policy network for solving flexible job shop scheduling problem with setup times and rescoure constraints.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

2021
CN-Motifs Perceptive Graph Neural Networks.
IEEE Access, 2021

A Self-learning Harris Hawks Optimization Algorithm for Flexible Job Shop Scheduling with Setup Times and Resource Constraints.
Proceedings of the 2021 IEEE International Conference on Systems, Man, and Cybernetics, 2021

A method for generating various style Chinese fonts in the absence of training data (S).
Proceedings of the 33rd International Conference on Software Engineering and Knowledge Engineering, 2021

2019
A Fast Greedy Algorithm for Finding Minimum Positive Influence Dominating Sets in Social Networks.
Proceedings of the IEEE INFOCOM 2019, 2019

2018
Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems.
Fuzzy Sets Syst., 2018

2017
Computing behavioural distance for fuzzy transition systems.
Proceedings of the 11th International Symposium on Theoretical Aspects of Software Engineering, 2017

2016
Multiple Unit Auctions with Budget Constraint.
Encyclopedia of Algorithms, 2016

Competitive Auction.
Encyclopedia of Algorithms, 2016

Adwords Pricing.
Encyclopedia of Algorithms, 2016

2015
Computing on binary strings.
Theor. Comput. Sci., 2015

2013
Vehicle Scheduling Problem on Trees.
Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications, 2013

2012
Multi-bidding strategy in sponsored search auctions.
J. Comb. Optim., 2012

2010
On Robustness of Forward-looking in Sponsored Search Auction.
Algorithmica, 2010

2009
Average Transitive Trustworthy Degrees for Trustworthy Networks.
Proceedings of the Rough Sets and Knowledge Technology, 4th International Conference, 2009

Max-Minimum Algorithm for Trust Transitivity in Trustworthy Networks.
Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence and International Conference on Intelligent Agent Technology, 2009

2008
Multiple Unit Auctions with Budget Constraint.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Competitive Auction.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Adwords Pricing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Unconditional competitive auctions with copy and budget constraints.
Theor. Comput. Sci., 2008

Arbitrage opportunities across sponsored search markets.
Theor. Comput. Sci., 2008

Forward looking Nash equilibrium for keyword auction.
Inf. Process. Lett., 2008

Strategies in Dynamic Pari-Mutual Markets.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Multi-bidding Strategy in Sponsored Keyword Auction.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2006
On discretization methods for approximating optimal paths in regions with direction-dependent costs.
Inf. Process. Lett., 2006

2005
On discretization methods for generalized weighted region shortest path problems.
Proceedings of the IEEE International Conference on Robotics and Biomimetics, 2005

Adaptive and relaxed visibility-based PRM.
Proceedings of the IEEE International Conference on Robotics and Biomimetics, 2005

2004
Binary-Coding-Based Ant Colony Optimization and Its Convergence.
J. Comput. Sci. Technol., 2004


  Loading...