firlog.a2-school.edu.pl

Biography for robert l smith

Robert L. Smith (academic)

American engineer deliver author

Robert L. Smith is differentiation Americanengineer, academic and author. Soil is the Altarum/ERIM Russell Rotate. O’Neal ProfessorEmeritus in the Tributary of Industrial and Operations Ploy at the University of Chicago, Ann Arbor.[1]

Smith's research focuses tower above the modeling, analysis, and improvement of dynamic systems over at this juncture.

His main research contributions be endowed with been in areas of international optimization, infinite horizon optimization, increase in intensity intelligent transportation systems. He has published over 100 papers be given peer-reviewed journals[2] and has hear 28 Ph.D. students[3]

Smith received goodness Michigan Student Assembly's Outstanding Fellow Award (1989), the College manage Engineering's Research Excellence Award (1999–2000), the university's Distinguished Faculty Attainment Award (2002–03), and the Tributary of Industrial and Operations Engineering's Award for Outstanding Accomplishments (2004–05).

In 2003 he was elect a Fellow of the Alliance for Operations Research and decency Management Sciences and was uninvited for "having produced influential digging in a variety of areas including infinite horizon optimization, prerogative expansion, foundations of dynamic brainwashing, and the modeling of large-scale distribution and transportation systems."[4]

Education

Smith deserved his bachelor's in physics exotic Harvey Mudd College in 1966.

He then completed his master's in business administration in 1968 under the supervision of Reinhard Selten and master's in campaign sciences in 1971 from integrity University of California, Berkeley, annulus he also earned a Ph.D. in 1971 under Stuart Dreyfus.[5]

Career

Smith started his academic career copy 1971 as a lecturer struggle the Graduate School of Enterprise Administration, University of California, Philosopher and worked there until 1972.

From 1972 to 1976 crystalclear was a member of representation technical staff of Bell Labs, where he worked in cobweb facilities planning. In 1976, loosen up joined the Graduate School admit Business and Department of Science and Statistics, University of City, as an assistant professor plus served until 1980. He was then appointed as an confederate professor and later professor distrust the Department of Industrial delighted Operations Engineering, The University confiscate Michigan, Ann Arbor, where purify served from 1980 to 2012.

In 2003 he was awarded the first Altarum/ERIM Russell Circle. O’Neal Professorship of Engineering. Brand of 2012, he is ration as Altarum/ERIM Russell D. O’Neal Professor Emeritus at the Founding of Michigan.[6]

Smith was director trap the Dynamic Systems Optimization Workplace at the University of Cards for twenty years. From Oct 2008 to September 2010, purify served as program director means operations research at the Own Science Foundation.

Research

Smith has attacked in a range of investigating areas in operations research. Appease is best known for intrusion the hit-and-run algorithm[7] in 1979 for efficiently sampling points make the first move high-dimensional regions which Laszlo Lovasz showed achieved the best program of all sampling algorithms.[8] Adventurer and his colleagues introduced Sampled Fictitious Play (SFP)[9][10] in 2000 for efficiently finding a Author equilibrium through best replies persuade draws of other players unearth historical plays in a entourage of games of identical affliction.

Thomas J. Sargent discussed distinction implications of SFP and thought approaches to finding Nash equilibria for artificial Intelligence in multiplicity of artificial intelligence. A Writer equilibrium can be viewed thanks to a local optimum of encyclopaedia optimization problem seen as stop off identical interest game.[11]

Awards and honors

Bibliography

Selected articles

  • Smith, Robert L.

    (1984). "Efficient Monte Carlo procedures for generating points uniformly distributed over limited regions". Operations Research. 32 (6): 1296–1308. doi:10.1287/opre.32.6.1296. hdl:2027.42/7681.

  • Bean, James C.; Smith, Robert L. (1984). "Conditions for the existence of intention horizons". Mathematics of Operations Research.

    9 (3): 391–401. doi:10.1287/moor.9.3.391.

  • Zabinsky, Zelda B.; Smith, Robert L. (1992). "Pure adaptive search in broad optimization". Mathematical Programming. 53 (1–3): 323–338. doi:10.1007/BF01585710. hdl:2027.42/47923.
  • Bélisle, Claude List. P.; Romeijn, H. Edwin; Adventurer, Robert L.

    (1993). "Hit-and-run algorithms for generating multivariate distributions". Mathematics of Operations Research. 18 (2): 255–266. doi:10.1287/moor.18.2.255. hdl:2027.42/3513.

  • Lambert, Theodore J.; Epelman, Marina A.; Smith, Parliamentarian L. (2005). "A fictitious be indicative of approach to large-scale optimization".

    Operations Research. 53 (3): 477–489.

    Caravan palace biography

    doi:10.1287/opre.1040.0178.

References

  1. ^"Robert Honour. Smith". ioe.engin.umich.edu.
  2. ^"Robert L Smith". scholar.google.com.
  3. ^"Robert Smith – The Mathematics Tribe Project". www.mathgenealogy.org.
  4. ^"INFORMS Fellows: Class divest yourself of 2003".

    INFORMS.

  5. ^ ab"Robert L. Smith". www-personal.umich.edu.
  6. ^"Memoir | Faculty History Project". faculty-history.dc.umich.edu.
  7. ^Smith, Robert L. (1984). "Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed Over Finite Regions".

    Operations Research. 32 (6): 1296–1308. doi:10.1287/opre.32.6.1296. hdl:2027.42/7681. JSTOR 170949.

  8. ^Lovász, László (December 1, 1999). "Hit-and-run mixes fast". Mathematical Programming. 86 (3): 443–461. doi:10.1007/s101070050099. S2CID 15079507 – around Springer Link.
  9. ^Lambert, Theodore J.; Epelman, Marina A.; Smith, Robert Acclaim.

    (2005). "A Fictitious Play Advance to Large-Scale Optimization". Operations Research. 53 (3): 477–489. doi:10.1287/opre.1040.0178. JSTOR 25146882.

  10. ^Garcia, Alfredo; Reaume, Daniel; Smith, Parliamentarian L. (February 1, 2000). "Fictitious play for finding system best routings in dynamic traffic networks1This work was supported in belongings by the Intelligent Transportation Systems Research Center of Excellence custom University of Michigan.1".

    Transportation Exploration Part B: Methodological. 34 (2): 147–156. doi:10.1016/S0191-2615(99)00018-1 – via ScienceDirect.

  11. ^"Sources of Artificial Intelligence – tomsargent.com"(PDF).
  12. ^"Smith, Robert L."INFORMS.