Scott Kirkpatrick is a computer scientist, and professor in the School of Engineering and Computer Science at the Hebrew University, Jerusalem. He has over 75,000 citations in the fields of information appliances design, statistical physics, and distributed computing.[1]
Scott Kirkpatrick | |
|---|---|
| Nationality | Israeli |
| Occupation(s) | Computer scientist, professor |
| Title | Professor at the School of Engineering and Computer Science at Hebrew University |
He initially worked at IBM's Thomas J. Watson Research Center with Daniel Gelatt and Mario Cecchi researching computer design optimization. They argued for "simulated annealing" via the Metropolis–Hastings algorithm, whereas one can obtain iterative improvement to a fast cooling process by "defining appropriate temperatures and energies".[2] Their research was published in Science and was an inflection point in heuristic algorithms.
Selected research
edit- Havlin, Shlomo, et al. "Challenges in network science: Applications to infrastructures, climate, social systems and economics." The European Physical Journal Special Topics 214.1 (2012): 273–293.
- Schneider, Johannes, and Scott Kirkpatrick. Stochastic optimization. Springer Science & Business Media, 2007.
- Carmi, Shai, et al. "A model of Internet topology using k-shell decomposition." Proceedings of the National Academy of Sciences 104.27 (2007): 11150–11154.
- Kirkpatrick, Scott, C. Daniel Gelatt, and Mario P. Vecchi. "Optimization by simulated annealing." science 220.4598 (1983): 671–680.
- Kirkpatrick, Scott. "Percolation and conduction." Reviews of modern physics 45.4 (1973): 574.
See also
editReferences
edit- ^ "Scott Kirkpatrick - Google Scholar". Google Scholar. Retrieved 11 November 2019.
- ^ Reed Business Information (9 June 1983). New Scientist. Reed Business Information. pp. 697–. ISSN 0262-4079.
{{cite book}}:|author=has generic name (help)