default search action
Ke Fu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j21]Shu Hu, Ke Fu:
Equilibrium analysis of the seller's fulfillment channels and sales channels. Eur. J. Oper. Res. 320(3): 544-558 (2025) - 2024
- [j20]Ke Fu, He Li, Xiaotian Shi:
An encoder-decoder architecture with Fourier attention for chaotic time series multi-step prediction. Appl. Soft Comput. 156: 111409 (2024) - [j19]Ke Fu, He Li, Yan Bai:
Mixformer: An improved self-attention architecture applied to multivariate chaotic time series prediction. Expert Syst. Appl. 241: 122484 (2024) - [j18]Ke Fu, He Li:
MCGnet with multi-level gated unit transformations: A time series prediction-based model for unknown pattern abnormality detection. Expert Syst. Appl. 258: 125088 (2024) - [j17]Ke Fu, He Li, Xiaotian Shi:
CTF-former: A novel simplified multi-task learning strategy for simultaneous multivariate chaotic time series prediction. Neural Networks 174: 106234 (2024) - [c8]Tianao Sun, Ke Fu, Weiming Huang, Kai Zhao, Yongshun Gong, Meng Chen:
Going Where, by Whom, and at What Time: Next Location Prediction Considering User Preference and Temporal Regularity. KDD 2024: 2784-2793 - [i1]Minxia Chen, Ke Fu, Teng Huang, Miao Bai:
Learning Decisions Offline from Censored Observations with ε-insensitive Operational Costs. CoRR abs/2408.07305 (2024) - 2023
- [j16]Ke Fu, Yanzhi Li, Huiqiang Mao, Zhaowei Miao:
Firms' production and green technology strategies: The role of emission asymmetry and carbon taxes. Eur. J. Oper. Res. 305(3): 1100-1112 (2023) - [j15]Shu Hu, Stuart X. Zhu, Ke Fu:
Optimal trade-in and refurbishment strategies for durable goods. Eur. J. Oper. Res. 309(1): 133-151 (2023) - [j14]Lingling Chen, Quanjun Zhao, Ke Fu, Xiaohui Zhao, Hongliang Sun:
Multi-user reinforcement learning based multi-reward for spectrum access in cognitive vehicular networks. Telecommun. Syst. 83(1): 51-65 (2023) - 2022
- [j13]Hao Chen, Quan Liu, Jian Huang, Ke Fu:
Efficiently tracking multi-strategic opponents: A context-aware Bayesian policy reuse approach. Appl. Soft Comput. 121: 108715 (2022) - [j12]Hao Chen, Quan Liu, Ke Fu, Jian Huang, Chang Wang, Jianxing Gong:
Accurate policy detection and efficient knowledge reuse against multi-strategic opponents. Knowl. Based Syst. 242: 108404 (2022) - [j11]Lingling Chen, Ke Fu, Quanjun Zhao, Xiaohui Zhao:
A multi-channel and multi-user dynamic spectrum access algorithm based on deep reinforcement learning in Cognitive Vehicular Networks with sensing error. Phys. Commun. 55: 101926 (2022) - 2020
- [j10]Min Wang, Ke Fu, Fan Min, Xiuyi Jia:
Active learning through label error statistical methods. Knowl. Based Syst. 189 (2020) - [c7]Ke Fu, Zhen Guo, Jun Ye:
Fire Detection Method Based on Improved Glowworm Swarm Optimization-Based TWSVM. SPIoT (1) 2020: 862-867
2010 – 2019
- 2018
- [j9]Zhaowei Miao, Huiqiang Mao, Ke Fu, Yu Wang:
Remanufacturing with trade-ins under carbon regulations. Comput. Oper. Res. 89: 253-268 (2018) - [c6]Min Wang, Ke Fu, Fan Min:
Active learning through two-stage clustering. FUZZ-IEEE 2018: 1-7 - 2017
- [j8]Weiwei Zhang, Zhongfei Li, Ke Fu, Fan Wang:
Effect of the Return Policy in a Continuous-Time Newsvendor Problem. Asia Pac. J. Oper. Res. 34(6): 1750031:1-1750031:28 (2017) - 2015
- [c5]Jing Liu, Ke Fu, Pingping Lu, Weixin Shang:
Supply chain analysis with export tax rebate policy. IEEM 2015: 915-918 - 2013
- [j7]Ke Fu, Zhaowei Miao, Jiayan Xu:
On Planar medianoid Competitive Location Problems with Manhattan Distance. Asia Pac. J. Oper. Res. 30(2) (2013) - [j6]Ke Fu, Jiayan Xu, Zhaowei Miao:
Newsvendor with multiple options of expediting. Eur. J. Oper. Res. 226(1): 94-99 (2013) - 2012
- [j5]Zhaowei Miao, Feng Yang, Ke Fu, Dongsheng Xu:
Transshipment service through crossdocks with both soft and hard time windows. Ann. Oper. Res. 192(1): 21-47 (2012)
2000 – 2009
- 2009
- [j4]Ke Fu, Vernon Ning Hsu, Chung-Yee Lee:
Note - Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem with Expediting. Manuf. Serv. Oper. Manag. 11(2): 229-236 (2009) - 2008
- [c4]Zhaowei Miao, Ke Fu, Qi Fei, Fan Wang:
Meta-heuristic Algorithm for the Transshipment Problem with Fixed Transportation Schedules. IEA/AIE 2008: 601-610 - 2007
- [j3]Ke Fu, James K. Mills:
Robust Control Design for a Planar Parallel robot. Int. J. Robotics Autom. 22(2) (2007) - 2006
- [j2]Ke Fu, Vernon Ning Hsu, Chung-Yee Lee:
Inventory and Production Decisions for an Assemble-to-Order System with Uncertain Demand and Limited Assembly Capacity. Oper. Res. 54(6): 1137-1150 (2006) - 2005
- [j1]Ke Fu, James K. Mills:
Convex integrated design (CID) method and its application to the design of a linear positioning system. IEEE Trans. Control. Syst. Technol. 13(5): 701-707 (2005) - [c3]Ke Fu, James K. Mills:
A planar parallel manipulator - dynamics revisited and controller design. IROS 2005: 331-336 - 2004
- [c2]Ke Fu, James K. Mills, Dong Sun:
Integrated Design of a Linear Positioning System with Applications to Electronic Manufacturing. ICRA 2004: 517-522 - 2002
- [c1]Ke Fu, Dong Sun, James K. Mills:
Simultaneous mechanical structure and control system design: optimization and convex approaches. ISIC 2002: 746-751
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-11-07 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint