Talk:Algorithms Seminar/Fall11
From ResearchWiki
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 [www.idsia.ch/~luca/aco2004.pdf Ant colony optimization] Intelligent Water Drops
8) Metropolis-Hastings algorithm: [http://elsa.berkeley.edu/reprints/misc/understanding.pdf [http://fedc.wiwi.hu-berlin.de/xplore/ebooks/html/csa/node27.html
9) Nelder-Mead Method: [http://math.fullerton.edu/mathews/n2003/neldermead/NelderMeadProof.pdf
11) Monkey Search: [www.ise.ufl.edu/cao/Book_DMSAOB/009mucherino.pdf
12) Firefly Algorithm: [http://groups.csail.mit.edu/mac/projects/amorphous/HC11/fcresear.html [http://bluescarni.info/documents/lukasik_firefly.pdf [http://arxiv.org/abs/1003.1464
13) No free lunch in search and optimization: [http://ti.arc.nasa.gov/m/profile/dhw/papers/78.pdf
14) Heuristics for NP-hard problems: [www.cs.ubc.ca/~hutter/previous-earg/EmpAlgReadingGroup/Sau02.pdf Heuristic SAT] [www.academic.marist.edu/~jzbv/algorithms/approximatetspalgorithms.pdf 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: Heuristic Search: http://www.cs.cf.ac.uk/Dave/AI2/node23.html Combinatorial Optimization: http://www.ida.liu.se/~zebpe/heuristic/ NP Hard problems and heuristics: http://www.cs.uky.edu/~lewis/cs-heuristic/text/contents.html Analysis of heuristics: Thesis: Eran Ofek, Rigorous Analysis of Heuristics for NP-hard Problems
