搜索资源列表
MaxClique.java
- 回溯法求解最大团问题，时间复杂度为O(n*2^n)。(The backtracking method is used to solve the maximum clique problem with a time complexity of O (n*2^n).)
马的遍历
- 可以指定查看指定个数的解。在进行遍历过程中用到了贪心算法和回溯的思想。(You can specify the solution to the specified number. In the process of traversing, we use greedy algorithm and backtracking idea.)
zengyi
- 用于实现基础的随动线性强化的回退映射算法的实现(Implementation of backtracking algorithm for linear enhancement based on implementation base)
Queen
- 采用拉斯维加斯算法和回溯法相结合，解决N皇后问题(Las Vegas using algorithms and backtracking Combination, N Queens problem solving)
matlab 实现backstepping控制
- 利用反步法实现路径跟踪，包括直线、椭圆，圆轨迹等(Path backtracking with backstepping)