Skip to content
GitLab
Menu
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Grégoire Grzeczkowicz
sho
Commits
633ddf25
Commit
633ddf25
authored
Nov 02, 2020
by
Grégoire Grzeczkowicz
Browse files
Add accents
parent
92975345
Changes
1
Hide whitespace changes
Inline
Side-by-side
README.md
View file @
633ddf25
...
...
@@ -123,13 +123,13 @@ Most exercises consists in adding a single function in an existing module
(or your own module) and use assemble it in the main executable.
1.
Implement a simulated annealing.
You can use num_simulated_annealing or bit_simulated_annealing solver
You can use
`
num_simulated_annealing
`
or
`
bit_simulated_annealing
`
solver
2.
Implement an evolutionary algorithm.
You can use num_genetic or bit_genetic
You can use
`
num_genetic
`
or
`
bit_genetic
`
3.
Implement an expected run time empirical cumulative density function.
You can call draw_ert.py with -N option for the number of run and -v option to choose a target value
You can call
`
draw_ert.py
`
with -N option for the number of run and -v option to choose a target value
4.
Implement a simple design of experiment to determine the best solver.
You can use try_solver to list the different parameter you want to try and get the best parameter
You can use
`
try_solver
.py`
to list the different parameter you want to try and get the best parameter
5.
Provide a solver for a competition.
For the competion, symply use my num_greedy
For the competion, symply use my
`
num_greedy
`
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment