| Presentation file |
introducer |
date |
paper |
video |
b
| I-Hsuan Yang, Chien-Pin Huang , Kun-Mao Chao, "A fast algorithm for computing a longest common increasing subsequence", Information Processing Letters 93 (P.249–253), 2005 |
沈之承 |
Jan. 10 |
 |
 |
| Chunyang Wang , Yuping Wang , Xiangjuan Wu, Xiaofang Guo, "A Distributed Storage MLCS Algorithm with Time Efficient Upper Bound and Precise Lower Bound", Information Sciences, Volume 618, December 2022, pp. 118-135 |
廖玟雯 |
Jan. 10 |
|
|
| Noam Brown, Tuomas Sandholm, "Superhuman AI for heads-up no-limit poker: Libratus beats top professionals", SCIENCE, December 2017, Vol 359, Issue 6374, pp. 418-424 |
林映妤 |
Jan. 10 |
|
|
| Chunyao Song, Tingjian Ge, "Window-chained longest common subsequence: Common event matching in sequences", 2015 IEEE 31st International Conference on Data Engineering, Seoul, Korea (South) |
陳冠傑 |
Jan. 17 |
|
|
| Xiaoyu Zhang, Wei Liu, and Fangchun Yang, "A Neural Model for Automatic Bidding of Contract Bridge", IEEE 22nd International Conference on High Performance Computing and Communications, 2020 |
朱宥諺 |
Jan. 31 |
|
|
| Sen Liu, Yuping Wang, Wuning Tong and Shiwei Wei, "A Fast and Memory Efficient MLCS Algorithm by Character Merging for DNA Sequences Alignment ",Bioinformatics Volume 36, Issue 4, February 2020, Pages 1066–1073 |
李健廷 |
Jan. 31 |
|
|
| Andrzej Jasinski, Yuansong Qiao, Enda Fallon, Ronan Flynn, "A Workflow Management Framework for the Dynamic Generation of Workflows that is Independent of the Application Environment",2021 IFIP/IEEE International Symposium on Integrated Network Management (IM), May 2021, Bordeaux, France |
林鈺宸 |
Jan. 31 |
|
|
| Naela Rizvi, Dharavath Ramesh, "Fair budget constrained workflow scheduling approach for heterogeneous clouds",Cluster Computing, Vol. 23, pp. 3185– 3201, 2020 |
簡志軒 |
Feb. 07 |
|
|
| Yoshifumi Sakai, "Maximal common subsequence algorithms", Theoretical Computer Science, Volume 793, November 2019, pp. 132-139 |
廖玟雯 |
Feb. 07 |
|
|
| Andy Nguyen, "Solving Cyclic Longest Common Subsequence in Quadratic Time", arxiv, 2012 |
沈之承 |
Feb. 07 |
|
|
| Mańdziuk Jacek, Jakub Suchan, "Who should bid higher, NS or WE, in a given Bridge deal.", IEEE International Joint Conference on Neural Networks (IJCNN). Budapest, Hungary, 2019. |
陳韻安 |
Feb. 14 |
|
|
| Judea Pearl, "SCOUT: A Simple Game-Searching Algorithm with Proven Optimal Properties", Association for the Advancement of Artificial Intelligence, August 18–21, 1980, Stanford, California |
林映妤 |
Feb. 14 |
|
|
| Yung-Hsing Peng, Chang-Biau Yang, "Finding the gapped longest common subsequence by incremental suffix maximum queries", Information and Computation, Volume 237, October 2014, Pages 95-100 |
陳冠傑 |
Feb. 14 |
|
|
| Youngjoon Kim, Youngho Kim, Jeong Seop Sim, "An Improved Order-Preserving Pattern Matching Algorithm Using Fingerprints", Mathematics, vol. 10, no. 12, 2022 |
陳冠廷 |
Feb. 21 |
|
|
| Xiaoyu Zhang, Wei Liu, Linhui Lou, and Fangchun Yang, "AI Enabled Bridge Bidding Supporting Interactive Visualization", Sensors(published by MDPI), 2022 |
朱宥諺 |
Feb. 21 |
|
|
| Ruiping Yuan, Luke Pan, Juntao Li, Zhixin Chen, "Road Network Optimization of Intelligent Warehouse Picking Systems Based on Improved Genetic Algorithm", 2021 IEEE 7th International Conference on Cloud Computing and Intelligent Systems (CCIS), November 2021, Xi'an, China |
林鈺宸 |
Feb. 21 |
|
|
| Glenn Manacher, "A New Linear-Time "On-Line" Algorithm for Finding the Smallest Initial Palindrome of a String", Journal of the ACM 22(1975) 346-351 |
何承翰 |
Mar. 07 |
|
|
| Luís M.S. Russo, Diogo Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco, "Order-Preserving Pattern Matching Indeterminate Strings", Information and Computation, Volume 289, November 2022 |
廖玟雯 |
Mar. 07 |
|
|
| Michael H. Albert, Alexander Golynski, Angele M. Hamel, Alejandro Lopez-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari, "Longest Increasing Subsequences in Sliding Windows", Theoretical Computer Science, Vol. 321, pp.405~414, 2004. |
沈之承 |
Mar. 07 |
|
|
| T. Cazenave and V. Ventos, "The αμ Search Algorithm for the Game of Bridge", arXiv, 2019. |
陳韻安 |
Mar. 13 |
|
|
| AHM Mahfuzur Rahman, M. Sohel Rahman, "Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems", Journal of Computers, Vol. 9, no. 8, August 2014, Page 1743-1754 |
李健廷 |
Mar. 13 |
|
|
| Maxime Crochemore, Ely Porat, "Fast computation of a longest increasing subsequence and application", Information and Computation, Volume 208, Issue 9, September 2010, Pages 1054-1059 |
陳冠傑 |
Mar. 13 |
|
|
| Jiang Rong, Tao Qin, Bo An, "Competitive Bridge Bidding with Deep Neural Networks", arXiv, 2019. |
朱宥諺 |
Mar. 20 |
|
|
| Bo Yang, Wentao Li, Jianrong Wang, Jingjie Yang, Tiantian Wang, Xin Liu, "A Novel Path Planning Algorithm for Warehouse Robots Based on a Two-Dimensional Grid Model", IEEE Access,Volume 8, April 2020, Page: 80347 - 80357 |
林鈺宸 |
Mar. 20 |
|
|
| Ting Sun, Chuangbai Xiao and Xiujie Xu, "A scheduling algorithm using sub-deadline for workflow applications under budget and deadline constrained", Cluster Computing, Vol. 22, pp. 5987–5996, 2019 |
簡志軒 |
Mar. 20 |
|
|
| Youngho Kim, Munseong Kang, Joong Chae Na, Jeong Seop Sim, "Order-Preserving Pattern Matching with Scaling", Information Processing Letters, Volume 180, 2023. |
廖玟雯 |
Apr. 11 |
|
|
| Qucheng Gong, Tina Jiang, Yuandong Tian, "Simple is Better: Training an End-to-end Contract Bridge Bidding Agent without Human Knowledge", ICLR 2020 Conference Blind Submission, September 26, 2019, Addis Ababa, Ethiopia |
林映妤 |
Apr. 11 |
|
|
| Sergei Bespamyatnikh, Michael Segal, "Enumerating Longest Increasing Subsequences and Patience Sorting", Information Processing Letters 76, 2000, pp.7~11. |
沈之承 |
Apr. 11 |
|
|
| Chun Lin, Chao-Yuan Huang, Ming-Jer Tsai, "An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences", International Computing and Combinatorics Conference 2021: Computing and Combinatorics pp 25–36 |
陳冠傑 |
Apr. 18 |
|
|
| Daniel Andersson, "Hashiwokakero is NP-complete", Information Processing Letters 109, 2009, pp. 1145–1146 |
陳冠廷 |
Apr. 18 |
|
|
| Malik Reza F., Efendi R., Pratiwi Eriska A., "Solving Hashiwokakero Puzzle Game with Hashi Solving Techniques and Depth First Search", Bulletin of Electrical Engineering and Informatics, vol. 1, no. 1, pp. 61-68, 2012. |
陳韻安 |
Apr. 18 |
|
|
| M. P. Musiyenko, I. M. Zhuravska, I. V. Kulakovska, A. V. Kulakovska, "Simulation the Behavior of Robot Sub-Swarm in Spatial Corridors", 2016 IEEE 36th International Conference on Electronics and Nanotechnology (ELNANO). IEEE, 2016. |
林鈺宸 |
Apr. 25 |
|
|
| Leandro C. Coelho, Gilbert Laporte, Arinei Lindbeck, Thibaut Vidal, "Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle", arXiv, 2019 |
朱宥諺 |
Apr. 25 |
|
|
| Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, "Faster STR-IC-LCS Computation via RLE", 28th Annual Symposium on Combinatorial Pattern Matching 4-6 July 2017, Warsaw, Poland. |
何承翰 |
Apr. 25 |
|
|
| Domenico Cantone, Simone Faro and M.Oguzhan Külekci, "Shape-Preserving Pattern Matching", 21st Italian Conference on Theoretical Computer Science, 14-16 September 2020, Ischia, Italy |
廖玟雯 |
May. 02 |
|
|
| Zhan Peng and Yuping Wang, "A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem", School of Computer Science and Technology, Xidian University, Xi’an, China, Frontiers in Genetics, volume 8, 2017 |
沈之承 |
May. 02 |
|
|
| Eugene Curtin, Max Warshauer, "The Locker Puzzle", The Mathematical Intelligencer, Volume 28, Issue 1, December 2006, Pages 28-31 |
陳冠傑 |
May. 09 |
|
|
| |
|
|
|
|