| 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 |
|
|
| X. Zhang, R. Lin, Y. Bo, and F. Yang, "The Synergy of Double Neural Networks for Bridge Bidding", Mathematics 2022, 10, 3187. |
朱宥諺 |
May. 24 |
|
|
| Tamanna Chhabra, Jorma Tarhio, "A Filtration Method for Order-Preserving Matching", Information Processing Letters, Volume 116, Issue 2, February 2016, Pages 71-74 |
廖玟雯 |
May. 24 |
|
|
| Amr Elmasry, Max-Planck Institut für Informatik, Saarbrücken, "The Longest almost-Increasing Subsequence", Information Processing Letters, 2010 |
沈之承 |
May. 24 |
|
|
| Qucheng Gong and Yuandong Tian, "All Simulations Are Not Equal: Simulation Reweighing for Imperfect Information Games", International Conference on Learning Representations(ICLR), Millennium Hall, Addis Ababa ETHIOPIA, April 26-30, 2020. |
陳韻安 |
June. 06 |
|
|
| Stephen Lucas, Jason Rosenhouse, Andrew Schepler, "The Monty Hall Problem, Reconsidered", Mathematics Magazine, Vol. 82, No. 5 (2009), pp. 332-342 |
陳冠傑 |
June. 06 |
|
|
| Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park, "Cartesian Tree Matching and Indexing", arXiv:1905.08974v1 [cs.DS] 22 May 2019 |
廖玟雯 |
June. 06 |
|
|
| Daniel J. Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, Cosmin Paduraru, Edouard Leurent, Shariq Iqbal, Jean-Baptiste Lespiau, Alex Ahern, Thomas Köppe, Kevin Millikin, Stephen Gaffney, Sophie Elster, Jackson Broshear, Chris Gamble, Kieran Milan, Robert Tung, Minjae Hwang, Taylan Cemgil, Mohammadamin Barekatain, Yujia Li, Amol Mandhane, Thomas Hubert, Julian Schrittwieser, Demis Hassabis, Pushmeet Kohli, Martin Riedmiller, Oriol Vinyals & David Silver , "Faster sorting algorithms discovered using deep reinforcement learning", Nature, June, 2023 |
朱宥諺 |
June. 13 |
|
|
| Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, "Space-Efficient Algorithms for Longest Increasing Subsequence", Theory of Computing Systems 64, pp.522-541, 2020 |
沈之承 |
June. 13 |
|
|
| Y. Song, H. Qiu, Y. Wang, X. Zheng, "The optimization and improvement of bridge game system", 33rd Chinese Control and Decision Conference, 2021 |
朱宥諺 |
June. 27 |
|
|
| Sebastian Deorowicz, "A COVER-MERGING-BASED ALGORITHM FOR THE LONGEST INCREASING SUBSEQUENCE IN A SLIDING WINDOW PROBLEM", Computing and Informatics, Vol. 31, 2012, pp.1217–1233 |
沈之承 |
June. 27 |
|
|
| Somin Park, Jinhyeok Park, Youngho Kim and Jeong Seop Sim, "Order-Preserving Multiple Pattern Matching in Parallel", Applied Sciences. 2023, Vol. 13 Issue 8, pp. 5142-5151 |
廖玟雯 |
June. 27 |
|
|
| I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao, "A Fast Algorithm for Computing a Longest Common Increasing Subsequence", Information Processing Letters, Volume 93, Issue 5, 16 March 2005, Pages 249-253 |
陳冠傑 |
July. 04 |
|
|
| Gal Cohensius, Reshef Meir, Nadav Oved and Roni Stern, "Bidding in Spades", 24th European Conference on Artificial Intelligence(ECAI)Santiago de Compostela, Spain, 2020. |
陳韻安 |
July. 04 |
|
|
| Karthik Karur, Nitin Sharma, Chinmay Dharmatti, Joshua E. Siegel , "A Survey of Path Planning Algorithms for Mobile Robots", A Survey of Path Planning Algorithms for Mobile Robots. Vehicles, 3(3), 448-468. |
林鈺宸 |
July. 04 |
|
|
| 25th International Conference, "Solving the Double Dummy Bridge Problem with Shallow Autoencoders", Siem Reap, Cambodia, December 13-16, 2018 |
陳韻安 |
July. 11 |
|
|
| Md. Mahbubul Hasan, A.S.M. Shohidull Islam, Mohammad Saifur Rahman, M. Sohel Rahman, "Order Preserving Pattern Matching Revisited", Pattern Recognition Letters 55, 2015, pp.15-21 |
沈之承 |
July. 11 |
|
|
| C. Schensted, "Longest Increasing and Decreasing Subsequences", Canadian Journal of Mathematics, Volume 13, 1961, pp. 179 - 191 |
陳冠傑 |
July. 18 |
|
|
| Simone Faro and M. Oğuzhan Külekci, "Efficient Algorithms for the Order Preserving Pattern Matching Problem", Algorithmic Aspects in Information and Management, 2016, pp. 185–196 |
廖玟雯 |
July. 18 |
|
|
| Syed Abdullah Fadzli, Sani Iyal Abdulkadir, Mokhairi Makhtar, Azrul Amri Jamal, "Robotic Indoor Path Planning Using Dijkstra's Algorithm with Multi-Layer Dictionaries", 2015 2nd International Conference on Information Science and Security (ICISS), Seoul, Korea. |
林鈺宸 |
July. 18 |
|
|
| K. Mossakowski and J. Mańdziuk, "Neural Networks and the Estimation of Hands Strength in Contract Bridge", In Artificial Intelligence and Soft Computing–ICAISC, 8th International Conference, Zakopane, Poland, June 25-29, 2006. |
陳韻安 |
July. 25 |
|
|
| Toan Thang Ta, Yi-Kung Shieh, Chin Lung Lu, "Computing a Longest Common Almost-Increasing Subsequence of Two Sequences", Theoretical Computer Science, 2021, pp. 44–51 |
廖玟雯 |
July. 25 |
|
|
| Muhammad Rashed Alam, M. Sohel Rahman, "The substring inclusion constraint longest common subsequence problem can be solved in quadratic time", Muhammad Rashed Alam, M. Sohel Rahman |
沈之承 |
July. 25 |
|
|
| Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama, "Order-preserving matching", Theoretical Computer Science 525(2014) 68–79 |
張紋瑜 |
Aug. 01 |
|
|
| Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon, James F. Reid, "A Fast and Practical Bit-vector Algorithm for the Longest Common Subsequence Problem", Information Processing Letters, Volume 80, Issue 6, 31 December 2001, Pages 279-285 |
陳冠傑 |
Aug. 01 |
|
|
| Yu Zhao, Yongqiang Zhu, Pingxia Zhang, Qi Gao, Xue Han, "A Hybrid A* Path Planning Algorithm Based on Multi-objective Constraints", (August 2022). 2022 Asia Conference on Advanced Robotics, Automation, and Control Engineering (ARACE). Qingdao, China. |
林鈺宸 |
Aug. 01 |
|
|
| Sukhyeun Cho, Joong Chae Na, Jeong Seop Sim, "An O(𝒏^(𝟐 ) 𝒍𝒐𝒈 𝒎)-time Algorithm for the Boxed-mesh Permutation Pattern Matching Problem ", Theoretical Computer Science(2018), pp. 35-43 |
廖玟雯 |
Aug. 08 |
|
|
| Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi, "Computing Longest (Common) Lyndon Subsequences", 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022 |
俞鑫昌 |
Aug. 08 |
|
|
| Dipendra Gurung, Udit Kr. Chakraborty , Pratikshya Sharma, "Intelligent Predictive String Search Algorithm", 7th International Conference on Communication, Computing and Virtualization 2016, Mumbai, India. |
沈之承 |
Aug. 08 |
|
|
| Noam Brown, Tuomas Sandholm, "N-queens problem by efficient non-backtracking algorithm using local search, heuristics and Tabu search elements", The 10th International Conference on Digital Technologies 2014, July 2014, Zilina, Slovakia |
陳彥宇 |
Aug. 29 |
|
|
| George Law, "Quantitative Comparison of Flood Fill and Modified Flood Fill Algorithms", International Journal of Computer Theory and Engineering,Vol. 5, No. 3, June 2013 |
陳冠傑 |
Aug. 29 |
|
|
| Legras, S., Rouveirol, C., & Ventos, V., Pratikshya Sharma, "The Game of Bridge: A Challenge for ILP", 28th International Conference on Inductive Logic Programming, Ferrara, Italy, September 2–4, 2018. |
陳韻安 |
Aug. 29 |
|
|
| J. C. Backhus, H. Nonaka, T. Yoshikawa and M. Sugimoto, "Application of Reinforcement Learning to the Card Game Wizard", 2013 IEEE 2nd Global Conference on Consumer Electronics (at Tokyo, Japan), 2013 |
朱宥諺 |
Sept. 05 |
|
|
| Kunju Shi, Peng Wu, Mingshuai Liu, "Research on path planning method of forging handling robot based on combined strategy", 2021 IEEE International Conference on Power Electronics, Computer Applications (ICPECA). Shenyang, China. |
林鈺宸 |
Sept. 05 |
|
|
| Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, "Palindromic trees for a sliding window and its applications", Information Processing Letters, Volume 173, January 2022 |
李適宏 |
Sept. 05 |
|
|
| Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim, "A fast algorithm for order-preserving pattern matching", Information Processing Letters (2015), pp. 397-402 |
廖玟雯 |
Sept. 12 |
|
|
| SHILE CHEN(陳詩樂), CHANGJUN ZHOU(周昌軍), "Stock Prediction Based on Genetic Algorithm Feature Selection and Long Short-Term Memory Neural Network ", IEEE Access, Volume 9, 24 December 2020, Page : 9066 - 9072 |
楊景翔 |
Sept. 12 |
|
|
| Youhuan Li, Lei Zou, Huaming Zhang, and Dongyan Zhao, "Longest Increasing Subsequence Computation over Streaming Sequences", IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 6, June 2018 |
沈之承 |
Sept. 12 |
|
|
| Lei Wang, Xiaodong Wang, Yingjie Wu, Daxin Zhu, "A dynamic programming solution to a generalized LCS problem", Information Processing Letters 113 (2013) 723–728 |
張紋瑜 |
Sept. 19 |
|
|
| Ł Bienias, K Szczepański, P Duch, "Maze Exploration Algorithm for Small Mobile Platforms", Image Processing & Communications, vol. 21, no. 3, pp.15-26 |
陳冠傑 |
Sept. 19 |
|
|
| Asaf Amit and Shaul Markovitch, "Learning to bid in bridge", Machine Learning, 63, 287-327, 2006. |
陳韻安 |
Sept. 19 |
|
|
| Omer Baykal, Ferda Nur Alpaslan, "Reinforcement Learning in Card Game Environments Using Monte Carlo Methods and Artificial Neural Networks ", Omer Baykal, Ferda Nur Alpaslan, 4th International Conference on Computer Science and Engineering (at Samsun, Turkey), 2019 |
朱宥諺 |
Sept. 27 |
|
|
| 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, 2020, Addis Ababa, Ethiopia |
陳韻安 |
Oct. 18 |
|
|
| James W. Hunt, Thomas G. Szymanski, "A Fast Algorithm for Computing Longest Common Subsequences", Communications of the ACM. vol. 20. pp.350–353 (1977) |
陳彥宇 |
Oct. 18 |
|
|
| XiaoDong Wang, Lei Wang, and Daxin Zhu, "Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints", Journal of Computational Biology, Volume 26, Number 9, 2019, pp. 938-947 |
廖玟雯 |
Oct. 18 |
|
|
| Mussadiq Abdul Rahim, Sultan Daud Khan, Salabat Khan, Muhammad Rashid, Rafi Ullah, Hanan Tariq, "A Novel Spatio–Temporal Deep Learning Vehicle Turns Detection Scheme Using GPS-Only Data", IEEE Access 11 (2023): 8727-8733. |
林鈺宸 |
Oct. 24 |
|
|
| Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi , "A fast and simple algorithm for computing the longest common subsequence of run-length-encoded strings", Information Processing Letters 108 (2008) 360–364 |
李適宏 |
Oct. 24 |
|
|
| Sztyber-Betley, A., Kołodziej, F., Betley, J., & Duszak, P, "BridgeHand2Vec Bridge Hand Representation", arXiv:2310.06624, 2023. |
陳韻安 |
Nov. 07 |
|
|
| Tsung-Lin Lu, Kuo-Si Huang and Chang-Biau Yang, "An Algorithm for Finding the Longest Common Almost Wave Subsequence with the Trend", 14th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI 2023), pp. 424-429, Koriyama City, Fukushima ken, Japan, July 2023 |
廖玟雯 |
Nov. 07 |
|
|
| Jerome H. Friedman, "GREEDY FUNCTION APPROXIMATION: A GRADIENT BOOSTING MACHINE", The Annals of Statistics 2001, Vol. 29, No. 5, 1189–1232 |
楊景翔 |
Nov. 07 |
|
|
| Shin-Cheng Lin, Kuo-Si Huang and Chang-Biau Yang, "The Longest Almost Wave Subsequence Problem", CMCT2023 |
張紋瑜 |
Nov. 14 |
|
|
| Kuo-Si Huang, and Yu-Chen Lin, Chang-Biau Yang, Ho-Chun Lin, Yung-Hsing Peng and Szu-Hsuan Wang. |
林鈺宸 |
Nov. 14 |
|
|
| Sara Geizhals, Dina Sokol, "Finding Maximal 2-dimensional Palindromes", 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)Leibniz International Proceedings in Informatics (LIPIcs), Volume 54, pp. 19:1-19:12 |
陳冠傑 |
Nov. 14 |
|
|
| Ying-Yu Lin, Chang-Biau Yang, and Kuo-Si Huang, "The Prediction of the Most Suitable Contract in Non-competitive Bridge Bidding", Department of Computer Science and Engineering National Sun Yat-sen University, Kaohsiung, Taiwan |
朱宥諺 |
Nov. 21 |
|
|
| Ali Dehghani, Reza Namvar, Abdullah Khalili, "Henry V: A linear time algorithm for solving the N-Queens Problem using only 5 patterns", 28th International Computer Conference, Computer Society of Iran (CSICC), Tehran, Iran, 25-26 Jan. 2023 |
俞鑫昌 |
Nov. 21 |
|
|
| Youhuan Li, Lei Zou, Huaming Zhang, and Dongyan Zhao, "Longest Increasing Subsequence Computation over Streaming Sequences", IEEE Transcations on Knowledge and Data Engineering, vol. 30, no. 6, June 2018 |
沈之承 |
Nov. 21 |
|
|
| Alessandro Palmas, "DIAMBRA Arena: a New Reinforcement Learning Platform for Research and Experimentation", arXiv 19 Oct 2022 |
陳彥宇 |
Dec. 13 |
|
|
| Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar, "Longest previous overlapping factor array", Information Processing Letters 168 (2021) 106097 |
廖玟雯 |
Dec. 13 |
|
|
| Lockhart, E., Burch, N., Bard, N., Borgeaud, S., Eccles, T., Smaira, L., & Smith, R., "Human-Agent Cooperation in Bridge Bidding", arXiv:2011.14124, 2020. |
陳韻安 |
Dec. 13 |
|
|
| Gary Benson, Avivit Levy, Riva Shalom, "Longest Common Subsequence in k Length Substrings", Similarity Search and Applications: 6th International Conference, SISAP 2013A Coruña, Spain, October 2-4, 2013, Proceedings 6 (pp. 257-265) |
陳冠傑 |
Dec. 26 |
|
|
| Kevin Leyton-Brown, "Combining Probabilities", University of British Columbia.Probability and Combinatorics. (Apr. 22, 2019) |
林鈺宸 |
Dec. 26 |
|
|
| Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama, "Finding top-k longest palindromes in substrings", Theoretical Computer Science 979 (2023) 114183 |
李適宏 |
Dec. 26 |
|
|
| |
|
|
|
|