Talk:Algorithms Seminar/Fall11
From ResearchWiki
(Possible Topics) |
m |
||
| Line 1: | Line 1: | ||
| - | Possible Topics: | + | '''Possible Topics''': |
| - | 1) Cuckoo Search | + | |
| + | 1) Cuckoo Search: | ||
http://arxiv.org/abs/1003.1594v1 | http://arxiv.org/abs/1003.1594v1 | ||
| - | 2) Simulated Annealing | + | 2) Simulated Annealing: |
http://www.fisica.uniud.it/~ercolessi/MC/kgv1983.pdf | http://www.fisica.uniud.it/~ercolessi/MC/kgv1983.pdf | ||
| - | 3) SVM | + | 3) SVM: |
http://www.svms.org/tutorials/Hearst-etal1998.pdf | http://www.svms.org/tutorials/Hearst-etal1998.pdf | ||
| - | 4) Evolutionary Algorithms: | + | 4) Evolutionary Algorithms: |
http://www.geatbx.com/docu/algindex.html | http://www.geatbx.com/docu/algindex.html | ||
| - | 5) Gradient Descent / Hill Climbing | + | 5) Gradient Descent / Hill Climbing: |
http://webdocs.cs.ualberta.ca/~sutton/book/8/node3.html | http://webdocs.cs.ualberta.ca/~sutton/book/8/node3.html | ||
http://www.ri.cmu.edu/pub_files/pub1/baird_leemon_1999_1/baird_leemon_1999_1.pdf | http://www.ri.cmu.edu/pub_files/pub1/baird_leemon_1999_1/baird_leemon_1999_1.pdf | ||
| - | 6) Alternating Optimization, EM like methods | + | 6) Alternating Optimization, EM like methods: |
http://geomblog.blogspot.com/2008/01/important-heuristics-alternating.html | http://geomblog.blogspot.com/2008/01/important-heuristics-alternating.html | ||
http://www.springerlink.com/content/c21tfr6cxmjbmq3r/ | http://www.springerlink.com/content/c21tfr6cxmjbmq3r/ | ||
http://dl.acm.org/citation.cfm?id=964886 | http://dl.acm.org/citation.cfm?id=964886 | ||
| - | 7) Swarm Intelligence based methods | + | 7) Swarm Intelligence based methods: |
http://www.springerlink.com/content/q528q1743224q233/ | http://www.springerlink.com/content/q528q1743224q233/ | ||
Ant colony optimization: www.idsia.ch/~luca/aco2004.pdf | Ant colony optimization: www.idsia.ch/~luca/aco2004.pdf | ||
Intelligent Water Drops: http://www.inderscience.com/filter.php?aid=22775 | Intelligent Water Drops: http://www.inderscience.com/filter.php?aid=22775 | ||
| - | 8) Metropolis-Hastings algorithm | + | 8) Metropolis-Hastings algorithm: |
http://elsa.berkeley.edu/reprints/misc/understanding.pdf | http://elsa.berkeley.edu/reprints/misc/understanding.pdf | ||
http://fedc.wiwi.hu-berlin.de/xplore/ebooks/html/csa/node27.html | http://fedc.wiwi.hu-berlin.de/xplore/ebooks/html/csa/node27.html | ||
| - | 9) Nelder-Mead Method | + | 9) Nelder-Mead Method: |
http://math.fullerton.edu/mathews/n2003/neldermead/NelderMeadProof.pdf | http://math.fullerton.edu/mathews/n2003/neldermead/NelderMeadProof.pdf | ||
| - | 11) Monkey Search | + | 11) Monkey Search: |
www.ise.ufl.edu/cao/Book_DMSAOB/009mucherino.pdf | www.ise.ufl.edu/cao/Book_DMSAOB/009mucherino.pdf | ||
| - | 12) Firefly Algorithm | + | 12) Firefly Algorithm: |
http://groups.csail.mit.edu/mac/projects/amorphous/HC11/fcresear.html | http://groups.csail.mit.edu/mac/projects/amorphous/HC11/fcresear.html | ||
http://bluescarni.info/documents/lukasik_firefly.pdf | http://bluescarni.info/documents/lukasik_firefly.pdf | ||
http://arxiv.org/abs/1003.1464 | http://arxiv.org/abs/1003.1464 | ||
| - | 13) No free lunch in search and optimization | + | 13) No free lunch in search and optimization: |
http://ti.arc.nasa.gov/m/profile/dhw/papers/78.pdf | http://ti.arc.nasa.gov/m/profile/dhw/papers/78.pdf | ||
| - | 14) Heuristics for NP-hard problems | + | 14) Heuristics for NP-hard problems: |
a) Heuristic SAT | a) Heuristic SAT | ||
www.cs.ubc.ca/~hutter/previous-earg/EmpAlgReadingGroup/Sau02.pdf | www.cs.ubc.ca/~hutter/previous-earg/EmpAlgReadingGroup/Sau02.pdf | ||
| Line 66: | Line 67: | ||
| - | Related areas: | + | '''Related areas''': |
| + | |||
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. | ||
| - | Talks: | + | '''Talks''': |
| + | |||
Effective Heuristics for NP-Hard Problems, Richard Karp | Effective Heuristics for NP-Hard Problems, Richard Karp | ||
| - | Books: | + | '''Books''': |
| + | |||
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. | ||
| Line 81: | Line 85: | ||
Yang, Nature-Inspired Metaheuristic Algorithms | Yang, Nature-Inspired Metaheuristic Algorithms | ||
| - | Other Links: | + | '''Other Links''': |
Heuristic Search: http://www.cs.cf.ac.uk/Dave/AI2/node23.html | Heuristic Search: http://www.cs.cf.ac.uk/Dave/AI2/node23.html | ||
Combinatorial Optimization: http://www.ida.liu.se/~zebpe/heuristic/ | 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 | 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 | Analysis of heuristics: Thesis: Eran Ofek, Rigorous Analysis of Heuristics for NP-hard Problems | ||
Revision as of 18:11, 18 August 2011
Possible Topics:
1) Cuckoo Search: http://arxiv.org/abs/1003.1594v1
2) Simulated Annealing: http://www.fisica.uniud.it/~ercolessi/MC/kgv1983.pdf
3) SVM: http://www.svms.org/tutorials/Hearst-etal1998.pdf
4) Evolutionary Algorithms: http://www.geatbx.com/docu/algindex.html
5) Gradient Descent / Hill Climbing: http://webdocs.cs.ualberta.ca/~sutton/book/8/node3.html http://www.ri.cmu.edu/pub_files/pub1/baird_leemon_1999_1/baird_leemon_1999_1.pdf
6) Alternating Optimization, EM like methods: http://geomblog.blogspot.com/2008/01/important-heuristics-alternating.html http://www.springerlink.com/content/c21tfr6cxmjbmq3r/ http://dl.acm.org/citation.cfm?id=964886
7) Swarm Intelligence based methods: http://www.springerlink.com/content/q528q1743224q233/ Ant colony optimization: www.idsia.ch/~luca/aco2004.pdf Intelligent Water Drops: http://www.inderscience.com/filter.php?aid=22775
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: a) Heuristic SAT www.cs.ubc.ca/~hutter/previous-earg/EmpAlgReadingGroup/Sau02.pdf
b) Heuristic TSP www.academic.marist.edu/~jzbv/algorithms/approximatetspalgorithms.pdf www.ida.liu.se/~TDDB19/reports_2003/htsp.pdf Animation - http://www-e.uni-magdeburg.de/mertens/TSP/
c) Heuristic Vehicle Routing Problem TABUROUTE: http://www.cs.amherst.edu/~ccm/cs34/papers/tabuveh2661622.pdf http://dl.acm.org/citation.cfm?id=1224164 www.iro.umontreal.ca/~gendron/PLU6000/chap5ca99b.ps www.diku.dk/hjemmesider/ansatte/sropke/Papers/PHDThesis.pdf
d) Heuristic Set Cover http://home.dei.polimi.it/malucell/papers/stellac.pdf
e) Heuristic Task Scheduling http://dl.acm.org/citation.cfm?id=89230
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
