- 會議論文
- OpenAccess
韋伯問題之趨近解
The Approximation of Weber Point
延伸閱讀
- 詹景裕、鄔宗羲、呂紹偉、林獻堂（2018）。韋伯問題之避障趨近解。載於國立東華大學（主編），NCS 2017 全國計算機會議（頁227-231）。國立東華大學。https://doi.org/10.29428/9789860544169.201801.0043
- 李俊增（2012）。程序主義與反思（身）法典範之爭：從哈伯馬斯對韋伯法理論之批判談起。歐美研究，42(1)，83-165。https://doi.org/10.7015/JEAS.201203.0083
- Chang, C. C. (2004). 植基於韋伯分佈之集中化序列投資問題參數估計方法. 工業工程學刊, 21(5), 504-515. https://doi.org/10.29977/JCIIE.200409.0009
- Shiau, J. Y. (2018). Tight Approximation for Partial Vertex Cover with Hard Capacities [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU201800747
- Datta, A., Cusack, R., Hawkins, K., Heutink, J., Rorden, C., Robertson, I. H., & Manly, T. (2007). The P300 as a Marker of Waning Attention and Error Propensity. Computational Intelligence and Neuroscience, 2007(), 414-422. https://doi.org/10.1155/2007/93968