Edward+Hamilton

an American computer scientist, software architect and software engineer with long time experience in the area of optimization for high-volume, on-demand service industries. His interests include computer chess, [|stock market prediction], and [|financial data] [|sonification]. He holds a [|BS CS] and a [|BA] in mathematics from University of California, Santa Cruz in 1996, where he worked with Robert Levinson et al. on Morph. He developed a method to convert a chess mobility graph to a [|resistive network] which could be computed using the [|residual resistance] property of interconnect chips. Replacing the chess piece (node) with a [|web page] and an attack (edge) with a [|backlink], then is similar to modeling [|Google's] [|PageRank] as a resistive network. || toc =Selected Publications=
 * Home * People * Edward Hamilton**
 * [[image:EdwardHamilton.jpg link="https://github.com/edwardhamilton"]] ||~ || **Edward (Ed) Hamilton**,
 * Edward Hamilton ||~ ||^ ||
 * Jonathan Allen, Edward Hamilton, Robert Levinson (**1997**). //New Advances in Adaptive Pattern-Oriented Chess//. Advances in Computer Chess 8
 * [|Alex Fukunaga], Ed Hamilton, [|Jason Fama], [|David Andre], [|Ofer Matan], [|Illah Nourbakhsh] (**2002**). //Staff Scheduling for Inbound Call Centers and Customer Contact Centers//. AI Magazine, Vol. 23, No. 4, [|pdf]

=External Links=
 * [|Edward Hamilton | LinkedIn]
 * [|edwardhamilton (Edward Hamilton) · GitHub]

=References= =What links here?= include page="Edward Hamilton" component="backlinks" limit="20"
 * Up one level**