정의: Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction or enumeration problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.
| 핵심 연구 분야 | Infrastructure |
|---|---|
| 주요 연도 | 2022년 |
| 주요 연관 키워드 | security |
| 좋아요 수 | 0 |