Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Jingda_yang
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(37)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Recent activity by Jingda_yang
1
answer
N-Queens Count all conflicts in O(n) time
commented
Apr 9, 2018
in
Informed Search
n-queens
ai
count
conflict
1
answer
In the context of informed search, what is the difference between complete, optimal and optimally efficient algorithm?
answer edited
Mar 19, 2018
in
Informed Search
a-star
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc