Talk:Algorithms Seminar/Fall11
From ResearchWiki
m (Minor edits) |
m (Minor edits) |
||
| Line 24: | Line 24: | ||
7) Swarm Intelligence based methods: | 7) Swarm Intelligence based methods: | ||
[http://www.springerlink.com/content/q528q1743224q233/ 1], | [http://www.springerlink.com/content/q528q1743224q233/ 1], | ||
| - | [www.idsia.ch/~luca/aco2004.pdf Ant colony optimization], | + | [http://www.idsia.ch/~luca/aco2004.pdf Ant colony optimization], |
[http://www.inderscience.com/filter.php?aid=22775 Intelligent Water Drops] | [http://www.inderscience.com/filter.php?aid=22775 Intelligent Water Drops] | ||
| Line 60: | Line 60: | ||
Metaheuristics: Search within a search space of problem solutions. | Metaheuristics: Search within a search space of problem solutions. | ||
| + | |||
Hyper-heuristics: Search within a search space of heuristics. | Hyper-heuristics: Search within a search space of heuristics. | ||
| Line 71: | Line 72: | ||
J Pearl, Heuristics: intelligent search strategies for computer problem solving. | J Pearl, Heuristics: intelligent search strategies for computer problem solving. | ||
| + | |||
CR Reeves, Modern Heuristic Techniques for Combinatorial Problems. | CR Reeves, Modern Heuristic Techniques for Combinatorial Problems. | ||
| + | |||
Eric Bonabeau, Marco Dorigo, Guy Theraulaz, Swarm intelligence: from natural to artificial systems. | Eric Bonabeau, Marco Dorigo, Guy Theraulaz, Swarm intelligence: from natural to artificial systems. | ||
| + | |||
Yang, Nature-Inspired Metaheuristic Algorithms | Yang, Nature-Inspired Metaheuristic Algorithms | ||
| + | |||
'''Other Links''': | '''Other Links''': | ||
| - | + | ||
| - | + | [http://www.cs.cf.ac.uk/Dave/AI2/node23.html Heuristic Search] | |
| - | + | ||
| + | [http://www.ida.liu.se/~zebpe/heuristic/ Combinatorial Optimization] | ||
| + | |||
| + | [http://www.cs.uky.edu/~lewis/cs-heuristic/text/contents.html NP Hard problems and heuristics] | ||
| + | |||
Analysis of heuristics: Thesis: Eran Ofek, Rigorous Analysis of Heuristics for NP-hard Problems | Analysis of heuristics: Thesis: Eran Ofek, Rigorous Analysis of Heuristics for NP-hard Problems | ||
Revision as of 18:20, 18 August 2011
Possible Topics:
1) Cuckoo Search: 1
2) Simulated Annealing: 1
3) SVM: 1
4) Evolutionary Algorithms: 1
5) Gradient Descent / Hill Climbing: 1, 2
6) Alternating Optimization, EM like methods: 1, 2, 3
7) Swarm Intelligence based methods: 1, Ant colony optimization, Intelligent Water Drops
8) Metropolis-Hastings algorithm: 1, 2
9) Nelder-Mead Method: 1
11) Monkey Search: 1
12) Firefly Algorithm: 1, 2, 3
13) No free lunch in search and optimization: 1
14) Heuristics for NP-hard problems: Heuristic SAT, Heuristic TSP, TSP Animation, TABUROUTE, Heuristic Vehicle Routing Problem, Vehicle Routing 2, Routing-thesis, Heuristic Set Cover, Heuristic Task Scheduling
Related areas:
Metaheuristics: Search within a search space of problem solutions.
Hyper-heuristics: Search within a search space of heuristics.
Talks:
Effective Heuristics for NP-Hard Problems, Richard Karp
Books:
J Pearl, Heuristics: intelligent search strategies for computer problem solving.
CR Reeves, Modern Heuristic Techniques for Combinatorial Problems.
Eric Bonabeau, Marco Dorigo, Guy Theraulaz, Swarm intelligence: from natural to artificial systems.
Yang, Nature-Inspired Metaheuristic Algorithms
Other Links:
NP Hard problems and heuristics
Analysis of heuristics: Thesis: Eran Ofek, Rigorous Analysis of Heuristics for NP-hard Problems
