Presentation is loading. Please wait.

Presentation is loading. Please wait.

Wei-Cheng Chen mento0513@gmail.com http://myweb.ncku.edu.tw/~f74002060/Course5.rar Department of Computer Science and Information Engineering National.

Published byLeon Simpson Modified over 6 years ago

Similar presentations

Presentation on theme: "Wei-Cheng Chen mento0513@gmail.com http://myweb.ncku.edu.tw/~f74002060/Course5.rar Department of Computer Science and Information Engineering National."— Presentation transcript:

1 Wei-Cheng Chen mento0513@gmail.com
Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513

2 Backtracking What is backtracking? A searching technique Goal
Find solutions under some constraints Try to list out all kinds of possible ways Concept Enumerate ( 枚舉 ) Pruning ( 剪枝 ) made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

3 Example Goal give 5 numbers ( 1~5 )
choose 3 numbers and list out by its order possible solution – 、 、 … 想想怎麼用recursive實作，想通你就會一半了 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

4 Example made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

5 Example 1 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

6 Example 1 1 2 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

7 Example 1 1 2 1 2 3 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

8 Example 1 1 2 1 2 3 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

9 Example 1 1 2 1 2 3 1 2 4 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

10 Example 1 1 2 1 2 3 1 2 4 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

11 Example 1 1 2 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

12 Example 1 1 2 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

13 Example 1 1 2 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

14 Example 1 1 2 1 3 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

15 Example 1 1 2 1 3 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

16 Example 1 1 2 1 3 After a while . . . 1 2 3 1 2 4 1 2 5 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

17 Example You find all the solution 123 234 345 124 235 125 245 134 135
145 made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

18 Strategy Enumerate possible solution by DFS order
Set the end point (or stack overflow) return when find out a solution Answer Array maintain possible solution during searching Prune Skip unnecessary search made by electron & kk & rabbit125 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

19 Pseudo Code made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

20 Practice Uva 441 Uva 167 made by electron & kk & rabbit125
NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

21 HOMEWORK 　Uva : 167,200,291,441,524,574,624,750,989,10305,10503,11085,11686 　POJ : 367,1094,1128,1101

22 made by electron & kk & rabbit125
made by mento0513 NCKU CSIE Programming Contest Training Course made by mento0513 & kevinx6000

Download ppt "Wei-Cheng Chen mento0513@gmail.com http://myweb.ncku.edu.tw/~f74002060/Course5.rar Department of Computer Science and Information Engineering National."

Similar presentations

Deep Packet Inspection with DFA-trees and Parametrized Language Overapproximation Author: Daniel Luchaup, Lorenzo De Carli, Somesh Jha, Eric Bach Publisher:

Deep Packet Inspection with DFA-trees and Parametrized Language Overapproximation Author: Daniel Luchaup, Lorenzo De Carli, Somesh Jha, Eric Bach Publisher:
Scalable Packet Classification Using Hybrid and Dynamic Cuttings Authors : Wenjun Li,Xianfeng Li Publisher : Engineering Lab on Intelligent Perception.

Scalable Packet Classification Using Hybrid and Dynamic Cuttings Authors : Wenjun Li,Xianfeng Li Publisher : Engineering Lab on Intelligent Perception.
Optimizing Regular Expression Matching with SR-NFA on Multi-Core Systems Authors : Yang, Y.E., Prasanna, V.K. Yang, Y.E. Prasanna, V.K. Publisher : Parallel.

Optimizing Regular Expression Matching with SR-NFA on Multi-Core Systems Authors : Yang, Y.E., Prasanna, V.K. Yang, Y.E. Prasanna, V.K. Publisher : Parallel.
A Novel Cell Placement Algorithm For Flexible TFT Circuit With Mechanical Strain And Temperature Consideration Jiun-Li Lin, Po-Hsun Wu, and Tsung-Yi Ho.

A Novel Cell Placement Algorithm For Flexible TFT Circuit With Mechanical Strain And Temperature Consideration Jiun-Li Lin, Po-Hsun Wu, and Tsung-Yi Ho.
Recursive Algorithms Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

Recursive Algorithms Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
HybridCuts: A Scheme Combining Decomposition and Cutting for Packet Classification Authors : Wenjun Li, Xianfeng Li Publisher : 2013 IEEE 21st Annual Symposium.

HybridCuts: A Scheme Combining Decomposition and Cutting for Packet Classification Authors : Wenjun Li, Xianfeng Li Publisher : 2013 IEEE 21st Annual Symposium.
Thopson NFA Presenter: Yuen-Shuo Li Date: 2014/5/7 Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C.

Thopson NFA Presenter: Yuen-Shuo Li Date: 2014/5/7 Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C.
Packet Classification using Rule Caching Author: Nitesh B. Guinde, Roberto Rojas-Cessa, Sotirios G. Ziavras Publisher: IISA, 2013 Fourth International.

Packet Classification using Rule Caching Author: Nitesh B. Guinde, Roberto Rojas-Cessa, Sotirios G. Ziavras Publisher: IISA, 2013 Fourth International.
Software Engineering Laboratory, Department of Computer Science, Graduate School of Information Science and Technology, Osaka University What Do Practitioners.

Software Engineering Laboratory, Department of Computer Science, Graduate School of Information Science and Technology, Osaka University What Do Practitioners.
Packet Classification Using Multi-Iteration RFC Author: Chun-Hui Tsai, Hung-Mao Chu, Pi-Chung Wang Publisher: COMPSACW, 2013 IEEE 37th Annual (Computer.

Packet Classification Using Multi-Iteration RFC Author: Chun-Hui Tsai, Hung-Mao Chu, Pi-Chung Wang Publisher: COMPSACW, 2013 IEEE 37th Annual (Computer.
3C Technologies & Information Appliances Instructors: Fu-Chiung Cheng ( 鄭福炯 ) Associate Professor Computer Science & Engineering Tatung University email:

3C Technologies & Information Appliances Instructors: Fu-Chiung Cheng ( 鄭福炯 ) Associate Professor Computer Science & Engineering Tatung University
Leveraging Traffic Repetitions for High- Speed Deep Packet Inspection Author: Anat Bremler-Barr, Shimrit Tzur David, Yotam Harchol, David Hay Publisher:

Leveraging Traffic Repetitions for High- Speed Deep Packet Inspection Author: Anat Bremler-Barr, Shimrit Tzur David, Yotam Harchol, David Hay Publisher:
A Regular Expression Matching Algorithm Using Transition Merging Department of Computer Science and Information Engineering National Cheng Kung University,

A Regular Expression Matching Algorithm Using Transition Merging Department of Computer Science and Information Engineering National Cheng Kung University,
Department of Computer Science 1 Recursion & Backtracking 1.The game of NIM 2.Getting out of a maze 3.The 8 Queen’s Problem 4.Sudoku.

Department of Computer Science 1 Recursion & Backtracking 1.The game of NIM 2.Getting out of a maze 3.The 8 Queen’s Problem 4.Sudoku.
Developing Orientation based on Current project Huy-Tien, Bui 裴輝進 Department of Mechanical Engineering National Cheng Kung University Tainan, Taiwan March.

Developing Orientation based on Current project Huy-Tien, Bui 裴輝進 Department of Mechanical Engineering National Cheng Kung University Tainan, Taiwan March.
Intelligent DataBase System Lab, NCKU, Taiwan Josh Jia-Ching Ying 1, Wang-Chien Lee 2, Tz-Chiao Weng 1 and Vincent S. Tseng 1 1 Department of Computer.

Intelligent DataBase System Lab, NCKU, Taiwan Josh Jia-Ching Ying 1, Wang-Chien Lee 2, Tz-Chiao Weng 1 and Vincent S. Tseng 1 1 Department of Computer.
Early Detection of DDoS Attacks against SDN Controllers

Early Detection of DDoS Attacks against SDN Controllers
Binary-tree-based high speed packet classification system on FPGA Author: Jingjiao Li*, Yong Chen*, Cholman HO**, Zhenlin Lu* Publisher: 2013 ICOIN Presenter:

Binary-tree-based high speed packet classification system on FPGA Author: Jingjiao Li*, Yong Chen*, Cholman HO**, Zhenlin Lu* Publisher: 2013 ICOIN Presenter:
Packet Classification Using Dynamically Generated Decision Trees

Packet Classification Using Dynamically Generated Decision Trees
GFlow: Towards GPU-based High- Performance Table Matching in OpenFlow Switches Author : Kun Qiu, Zhe Chen, Yang Chen, Jin Zhao, Xin Wang Publisher : Information.

GFlow: Towards GPU-based High- Performance Table Matching in OpenFlow Switches Author : Kun Qiu, Zhe Chen, Yang Chen, Jin Zhao, Xin Wang Publisher : Information.

Similar presentations

Ads by Google