Difference between revisions of "Warren D. Smith"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 7: | Line 7: | ||
He was affiliated with the [[Bell Laboratories|AT&T Bell Laboratories]], the [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [https://en.wikipedia.org/wiki/Princeton,_New_Jersey Princeton, New Jersey], where he wrote most of his papers during the 90s, and with [https://en.wikipedia.org/wiki/DIMACS DIMACS]. | He was affiliated with the [[Bell Laboratories|AT&T Bell Laboratories]], the [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [https://en.wikipedia.org/wiki/Princeton,_New_Jersey Princeton, New Jersey], where he wrote most of his papers during the 90s, and with [https://en.wikipedia.org/wiki/DIMACS DIMACS]. | ||
His research interest covers the broad range of mathematics, physics, [https://en.wikipedia.org/wiki/Information_theory information theory], [https://en.wikipedia.org/wiki/Computer_science computer science] and [https://en.wikipedia.org/wiki/Politics politics], amongst other things on [[Algorithms|algorithms]], [https://en.wikipedia.org/wiki/Coding_theory coding theory], [https://en.wikipedia.org/wiki/Cryptography cryptography], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity], [[Search|game tree search]], [https://en.wikipedia.org/wiki/Game_theory game theory], computer chess, [https://en.wikipedia.org/wiki/Quantum_mechanics quantum mechanics], [https://en.wikipedia.org/wiki/Bayesian_statistics Bayesian statistics], [https://en.wikipedia.org/wiki/Range_voting range voting] and [https://en.wikipedia.org/wiki/Direct_democracy direct democracy]. | His research interest covers the broad range of mathematics, physics, [https://en.wikipedia.org/wiki/Information_theory information theory], [https://en.wikipedia.org/wiki/Computer_science computer science] and [https://en.wikipedia.org/wiki/Politics politics], amongst other things on [[Algorithms|algorithms]], [https://en.wikipedia.org/wiki/Coding_theory coding theory], [https://en.wikipedia.org/wiki/Cryptography cryptography], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity], [[Search|game tree search]], [https://en.wikipedia.org/wiki/Game_theory game theory], computer chess, [https://en.wikipedia.org/wiki/Quantum_mechanics quantum mechanics], [https://en.wikipedia.org/wiki/Bayesian_statistics Bayesian statistics], [https://en.wikipedia.org/wiki/Range_voting range voting] and [https://en.wikipedia.org/wiki/Direct_democracy direct democracy]. | ||
| + | |||
| + | =Test Suite for Chess Programs= | ||
| + | In 1993, along with [[Kevin J. Lang]], Warren D. Smith published and described a test suite for chess programs of about 5500 positions, optically scanned from chess books. | ||
| + | The suite is arranged in a number of files, each file being thematic by difficulty, tactical, positional and others <ref>[[Kevin J. Lang]], [[Warren D. Smith]] ('''1993'''). ''A Test Suite for Chess Programs''. [https://scorevoting.net/WarrenSmithPages/homepage/testpos.ps ps], [https://www.rangevoting.org/WarrenSmithPages/homepage/ChessTest2.tar.Z ChessTest2.tar.Z]</ref>. | ||
=BPIP-DFISA= | =BPIP-DFISA= | ||
Revision as of 15:23, 13 May 2020
Home * People * Warren D. Smith
Warren Douglas Smith,
an American physicist, mathematician, general theoretical scientist, and in 2005 founder of the Center of Range Voting [1].
He received a double B.Sc. from Massachusetts Institute of Technology in physics and mathematics, and a Ph.D. at Princeton University in the field of applied mathematics on computational geometry motivated by Mesh generation,
under Robert E. Tarjan and John H. Conway [2].
He was affiliated with the AT&T Bell Laboratories, the NEC Research Institute, Princeton, New Jersey, where he wrote most of his papers during the 90s, and with DIMACS.
His research interest covers the broad range of mathematics, physics, information theory, computer science and politics, amongst other things on algorithms, coding theory, cryptography, combinatorics, computational complexity, game tree search, game theory, computer chess, quantum mechanics, Bayesian statistics, range voting and direct democracy.
Contents
Test Suite for Chess Programs
In 1993, along with Kevin J. Lang, Warren D. Smith published and described a test suite for chess programs of about 5500 positions, optically scanned from chess books. The suite is arranged in a number of files, each file being thematic by difficulty, tactical, positional and others [3].
BPIP-DFISA
Along with Eric B. Baum et al., Warren D. Smith worked and published on game tree search, in particular the BPIP-DFISA (Best play for imperfect players - Depth free independent staircase approximation) search control model [4] [5], further generalized in 2004 by Yan Radovilsky and Solomon Eyal Shimony [6].
Smith Notation
Warren D. Smith proposed the Smith notation [7] as used in the Internet Chess Club chess server. The Smith notation encodes moves without any ambiguity using from-square, to-square, and to make it reversible, the captured piece if any - so it is as easy to go backwards as forwards while re-playing a game.
Selected Publications
1989
- Warren D. Smith (1989). Studies in Computational Geometry Motivated by Mesh Generation. Ph.D. thesis, Princeton University, advisors Robert E. Tarjan and John H. Conway [10]
1990 ...
- Andries E. Brouwer, James B. Shearer, Neil Sloane, Warren D. Smith (1990). A New Table of Constant Weight Codes. IEEE Transactions of Information Theory, Vol. 36
- Steven Skiena, Warren D. Smith, Paul Lemke (1990). Reconstructing Sets from Interpoint Distances. Symposium on Computational Geometry
- Warren D. Smith (1992). How To Find Steiner Minimal Trees in Euclidean d-Space. Algorithmica, Vol. 7, Nos. 2-6 [11] [12]
- Warren D. Smith (1992). Fundamental Physical Limits on Computation.
- Warren D. Smith (1992). Fixed Point for Negamaxing Probability Distributions on Regular Trees. NEC Research Institute
- Warren D. Smith (1992). Hash functions for Binary and Ternary Words. NEC Research Institute
- Kevin J. Lang, Warren D. Smith (1993). A Test Suite for Chess Programs. ps, ChessTest2.tar.Z
- Warren D. Smith (1993). Rating Systems for Gameplayers, and Learning.
- Warren D. Smith, Kevin J. Lang (1994). Values of the merging function and algorithm design as a game. NEC Research Institute
1995 ...
- Kevin J. Lang, Warren D. Smith (1995). A Test Suite for Chess Programs. ICCA Journal, Vol. 16, No. 3
- Eric B. Baum, Warren D. Smith (1995). Best Play for Imperfect Players and Game Tree Search. Part I - theory, with pseudocode appendix by Charles Garrett
- Warren D. Smith, Eric B. Baum, Charles Garrett, Rico Tudor (1995). Best Play for Imperfect Players and Game Tree Search. Part 2 - Experiments
- Eric B. Baum, Warren D. Smith (1997). A Bayesian Approach to Relevance in Game Playing. Artificial Intelligence, Vol. 97
- Warren D. Smith (1998). Taking the Fuzz Out of Fuzzy Logic. NEC Research Institute
- Eric B. Baum, Warren D. Smith (1999). Propagating Distributions Up Directed Acyclic Graphs. Neural Computation, Vol. 11, No. 1
2000 ...
- Warren D. Smith (2000). Range Voting. pdf
- Paul Lemke, Steven Skiena, Warren D. Smith (2002). Reconstructing Sets from Interpoint Distances. DIMACS Technical Report: 2002-37
- Warren D. Smith (2003). A new theorem in vector calculus. pdf
- Warren D. Smith (2004). Direct Democracy. pdf
- Warren D. Smith (2006). Church's thesis meets the N-body problem. Applied Mathematics and Computation, Vol. 178, No. 1, pdf preprint [13]
- Warren D. Smith (2007). 1. AES seems weak. 2. Linear time secure cryptography. pdf [14]
- Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson (2009). Linear-time nearest point algorithms for Coxeter lattices. 8https://arxiv.org/abs/0903.0673 arXiv:0903.0673]
2010 ...
- Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith (2014). Lower bounds on maximal determinants of +-1 matrices via the probabilistic method. arXiv:1211.3248
- Warren D. Smith (2014). Envy-Free allocations.
- Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith (2014). ounds on determinants of perturbed diagonal matrices. Linear Algebra and its Applications, Vol. 466, arXiv:1401.7084
- Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith (2016). Lower bounds on maximal determinants of binary matrices via the probabilistic method. arXiv:1402.6817
- Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith (2016). Probabilistic lower bounds on maximal determinants of binary matrices. Australasian Journal of Combinatorics, Vol. 66, arXiv:1501.06235
External Links
- The Future of Computers, AI (artificial intelligence), etc -- aka, You're gonna die, sucker by Warren D. Smith, March 07, 2013
- The Mathematics Genealogy Project - Warren Smith
- RangeVoting.org - Center for Range Voting
- Resume of Warren D. Smith
References
- ↑ Center for Range Voting - front page
- ↑ The Mathematics Genealogy Project - Warren Smith
- ↑ Kevin J. Lang, Warren D. Smith (1993). A Test Suite for Chess Programs. ps, ChessTest2.tar.Z
- ↑ Eric B. Baum, Warren D. Smith (1995). Best Play for Imperfect Players and Game Tree Search. Part 1 - Theory, with pseudocode appendix by Charles Garrett, pdf
- ↑ Re: Interesting ideas by Karlo Bala Jr., CCC, September 09, 2015
- ↑ Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. pdf
- ↑ Smith notation (Wayback Machine)
- ↑ dblp: Warren D. Smith
- ↑ Online list of Warren D. Smith's works
- ↑ Mesh generation from Wikipedia
- ↑ Steiner tree problem from Wikipedia
- ↑ Euclidean space from Wikipedia
- ↑ Church–Turing thesis from Wikipedia
- ↑ Advanced Encryption Standard from Wikipedia
