San Francisco / Belmont / Edmonton / Wellesley / St. Paul / Anaheim / Cassis / Budapest / Montreal / Dekker / Austin / Sarkar / Oxfordshire / Leipzig / Paris / Stockholm / The Hague / San Mateo / Pittsburgh / Redwood City / Portland / Blaisdell / Bibliography Andersen / Detroit / Amsterdam / Milan / Los Alamitos / Reading / Garden City / Waterloo / Durham / San Jose / Santa Cruz / Geneva / Santa Fe / Cremers / Gliwice / Auerbach / Seattle / River / Mouton / Norwood / Brisbane / Semiring / Boston / New York / Sydney / Marina del Rey / Madison / Washington / DC / Kansas City / Berlin / Loughborough / Los Angeles / Providence / Miami / Brafman / London / Nagoya / Wiley / Norman / Edinburgh / /
Company
Kaelbling L. P. / Prentice-Hall / Cambridge University Press / Neural Networks / MIT Press / AAAI Press/MIT Press / McDermott / Goldman / Bernstein / Oxford University Press / Princeton University Press / Wilson / Blinder A. S. / IEEE Computer Society Press / Database Systems / Boyd & Fraser Publishing Company / Macmillan / Edinburgh University Press / Neural Information Processing Systems / Rule-Based Expert Systems / Russell / ACM Press / AAAI Press / Pattern-Directed Inference Systems / Findler N. V. / Lawrence Erlbaum Associates / Singh S. P. / Associative Networks / University of Oklahoma Press / Bryson A. E. / A. K. Peters Ltd. / Harvard University Press / Garrett / Della Pietra S. A. / /
Country
Switzerland / Netherlands / France / Japan / Canada / Australia / United Kingdom / Scotland / Poland / Jordan / /
Facility
U.K. Loughborough University / California Institute of Technology / American Institute of Physics / American Institute of Electrical Engineers / University of Chicago Press / Information Sciences Institute / Carnegie-Mellon University / /
IndustryTerm
tree search / heuristic search / Web Conference / Linear leastsquares algorithms / probabilistic networks / Tree-bank grammars / search network / dynamic probabilistic networks / subdivision algorithm / semantic web / learning systems / tree search algorithm / heuristic mini-max search / search procedure / generalised quiescence search algorithm / adaptive importance sampling algorithm / expert systems / near optimal polynomial time algorithm / explicit search statistics / dynamic systems / largescale hypertextual web search engine / semantic networks / Genetic algorithms / public key encryption algorithm / natural language processing / /
OperatingSystem
Macintosh / /
Organization
American Institute of Electrical Engineers / Institution of Electrical Engineers / Cambridge University / American Institute of Physics / Information Sciences Institute / Princeton University / U.K. Loughborough University / International Society for Optical Engineering / Computer Science Department / Machine Intelligence / University of Chicago Press / Chicago / Carnegie-Mellon University / Pittsburgh / Oxford University / Pattern Analysis and Machine Intelligence / Neumann Society for Computing Sciences / California Institute of Technology / University of Oklahoma / Royal Society of London / Harvard University / Center for the Study of Language and Information / MIT / Tracking and Data Association / Acoustical Society of America / Federal Reserve Bank / National Academy of Sciences / Computational Intelligence / Association for Computing Machinery / Automatic Language Processing Advisory Committee / St. Petersburg Imperial Academy of Sciences / Center for the Study / Stanford / /
Person
Addison Wesley Longman / Lawrence Erlbaum / Morgan Kaufmann / Charles Savreux / /
Position
Computer vs. chess player / Bishop / planner / Farmer / cerebellar model articulation controller / Euclidean traveling salesman / structural data model for objects / /
ProgrammingLanguage
OPS5 / Prolog / /
ProvinceOrState
Minnesota / New York / Missouri / New Mexico / Rhode Island / South Carolina / Oklahoma / S. K. / California / Ontario / Alberta / Texas / New Jersey / Wisconsin / Maryland / Oregon / Pennsylvania / A. B. / Massachusetts / /
PublishedMedium
The Behavioral and Brain Sciences / Computational Linguistics / Automation and Remote Control / Journal of Artificial Intelligence Research / Proceedings of the national Academy of Sciences / American Naturalist / American Mathematical Monthly / IEEE Transactions on Pattern Analysis and Machine Intelligence / Scientific American / Philosophy and Phenomenological Research / Machine Learning / Philosophical Transactions of the Royal Society / Computer Graphics / Physical Review / Theoretical Computer Science / Theory of Computing / Lecture Notes in Computer Science / /
Technology
polynomial time algorithm / Linear leastsquares algorithms / subdivision algorithm / RSA public key encryption algorithm / Neural Network / B* tree search algorithm / DNA Chip / gene expression / adaptive importance sampling algorithm / training algorithm / generalised quiescence search algorithm / speech recognition / machine translation / search engine / Machine Learning / Image Processing / Computer Algorithms / Enabling technology / natural language processing / artificial intelligence / Data Mining / simulation / /
Bibliography Aldous, D. and Vazirani, U[removed]). “Go with the winners” algorithms. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 492–501, Santa Fe, New Mexico. IEEE Computer S