Skip to content

nqueens problem #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

nqueens problem #8

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
11f02ab
Update project ideas.md
francops1722 Nov 25, 2020
4b8b4ce
Merge pull request #7 from francops1722/master
MichielStock Nov 25, 2020
40a92dc
Update project ideas.md
MichielStock Nov 25, 2020
a335129
Create Project_SimonTavernier
SimonTavernier Nov 25, 2020
2b6c859
Update project ideas.md
SimonTavernier Dec 2, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions Project_SimonTavernier
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@

5 changes: 3 additions & 2 deletions project ideas.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ Optimization methods not covered in the theory. Provide a working implementation
- Conjugate gradient descent
- [Cross-entropy method](https://en.wikipedia.org/wiki/Cross-Entropy_Method)
- Firefly algorithm
- Bee Colony Optimization
- ~~Bee Colony Optimization~~
- Cuckoo search
- maximum flow problems
- Levenberg–Marquardt algorithm (for nonlinear regression and inverse kinematics)
Expand All @@ -23,7 +23,7 @@ Solve a problem using a method from the course or a new one.

- time table scheduling
- analytic solution of a ODE using genetic programming
- solve a Sudoku using local search
- ~~solve a Sudoku using local search~~
- graph matching using simulated annealing
- finding negative cycles using the Bellman–Ford algorithm
- multiple sequence alignment using Genetic Algorithms
Expand All @@ -32,6 +32,7 @@ Solve a problem using a method from the course or a new one.
- homebrew SVM
- recovering images from a few pixels using [compressed sensing](https://www.youtube.com/watch?v=SbU1pahbbkc) (L1-norm minimization)
- visalizing complex networks using quadratic optimization
- ~~Nqueens problem~~
- ...

## Theortic analysis
Expand Down