|
Alexander Brudno
Alexander L'vovich Brudno () (10 January 1918 – 1 December 2009) was a Russians, Russian computer scientist, best known for fully describing the alpha-beta pruning algorithm. From 1991 until his death he lived in Israel. Biography Brudno developed the "mathematics/machine interface" for the Fast Universal Digital Computer M-2, M-2 computer constructed in 1952 at the Krzhizhanovskii laboratory of the Institute of Energy of the Russian Academy of Sciences in the Soviet Union. He was a great friend of Alexander Kronrod. Brudno's work on alpha-beta pruning was published in 1963 in Russian and English. The algorithm was used in computer chess program written by Vladimir Arlazarov and others at the Institute for Theoretical and Experimental Physics (ITE ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Soviet Union
The Union of Soviet Socialist Republics. (USSR), commonly known as the Soviet Union, was a List of former transcontinental countries#Since 1700, transcontinental country that spanned much of Eurasia from 1922 until Dissolution of the Soviet Union, it dissolved in 1991. During its existence, it was the list of countries and dependencies by area, largest country by area, extending across Time in Russia, eleven time zones and sharing Geography of the Soviet Union#Borders and neighbors, borders with twelve countries, and the List of countries and dependencies by population, third-most populous country. An overall successor to the Russian Empire, it was nominally organized as a federal union of Republics of the Soviet Union, national republics, the largest and most populous of which was the Russian SFSR. In practice, Government of the Soviet Union, its government and Economy of the Soviet Union, economy were Soviet-type economic planning, highly centralized. As a one-party state go ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alan Kotok
Alan Kotok (November 9, 1941 – May 26, 2006) was an American computer scientist known for his work at Digital Equipment Corporation (Digital, or DEC) and at the World Wide Web Consortium (W3C). Steven Levy, in his book '' Hackers: Heroes of the Computer Revolution'', describes Kotok and his classmates at the Massachusetts Institute of Technology (MIT) as the first true hackers. Kotok was a precocious child who skipped two grades before college. At MIT, he became a member of the Tech Model Railroad Club, and after enrolling in MIT's first freshman programming class, he helped develop some of the earliest computer software including a digital audio program and what is sometimes called the first video game ('' Spacewar!''). Together with his teacher John McCarthy and other classmates, he was part of the team that wrote the Kotok-McCarthy program which took part in the first chess match between computers. After leaving MIT, Kotok joined the computer manufacturer Digital Equipme ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dartmouth Conference
The Dartmouth Conference is the longest continuous bilateral dialogue between American and Soviet representatives. The first Dartmouth Conference took place at Dartmouth College in 1961. Subsequent conferences were held through 1990. They were revived in 2014 and continue today. Task forces begun under the auspices of the main conference continued to work after the main conference stopped. The Regional Conflicts Task Force extended the sustained dialogue model, based on the Dartmouth experience, to conflicts in Tajikistan and Nagorno-Karabakh. Dartmouth inspired a number of other dialogues in the former Soviet Union and elsewhere, many of them under the auspices of the Sustained Dialogue Institute and the Kettering Foundation. Origin The Dartmouth Conference was begun by Norman Cousins, editor of the Saturday Review of Literature, and a founding member of the National Committee for a Sane Nuclear Policy (SANE). Speaking to the presidium of the Soviet Peace Committee in June 19 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
United States
The United States of America (USA), also known as the United States (U.S.) or America, is a country primarily located in North America. It is a federal republic of 50 U.S. state, states and a federal capital district, Washington, D.C. The 48 contiguous states border Canada to the north and Mexico to the south, with the semi-exclave of Alaska in the northwest and the archipelago of Hawaii in the Pacific Ocean. The United States asserts sovereignty over five Territories of the United States, major island territories and United States Minor Outlying Islands, various uninhabited islands in Oceania and the Caribbean. It is a megadiverse country, with the world's List of countries and dependencies by area, third-largest land area and List of countries and dependencies by population, third-largest population, exceeding 340 million. Its three Metropolitan statistical areas by population, largest metropolitan areas are New York metropolitan area, New York, Greater Los Angeles, Los Angel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arthur Samuel (computer Scientist)
Arthur Lee Samuel (December 5, 1901 – July 29, 1990) was an American pioneer in the field of computer gaming and artificial intelligence. He popularized the term "machine learning" in 1959. The Samuel Checkers-playing Program was among the world's first successful self-learning programs, and as such a very early demonstration of the fundamental concept of artificial intelligence (AI). He was also a senior member in the TeX community who devoted much time giving personal attention to the needs of users and wrote an early TeX manual in 1983. Biography Samuel was born on December 5, 1901, in Emporia, Kansas, and graduated from the College of Emporia in Kansas in 1923. He received a master's degree in Electrical Engineering from MIT in 1926, and taught for two years as an instructor. In 1928, he joined Bell Laboratories, where he worked mostly on vacuum tubes, including improvements of radar during World War II. He developed a gas-discharge transmit-receive switch (TR tube) that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John McCarthy (computer Scientist)
John McCarthy (September 4, 1927 – October 24, 2011) was an American computer scientist and cognitive scientist. He was one of the founders of the discipline of artificial intelligence. He co-authored the document that coined the term "artificial intelligence" (AI), developed the programming language family Lisp (programming language), Lisp, significantly influenced the design of the language ALGOL, popularized time-sharing, and invented Garbage collection (computer science), garbage collection. McCarthy spent most of his career at Stanford University. He received many accolades and honors, such as the 1971 Turing Award for his contributions to the topic of AI, the United States National Medal of Science, and the Kyoto Prize. Early life and education John McCarthy was born in Boston, Massachusetts, on September 4, 1927, to an Irish people, Irish immigrant father and a Lithuanian Jewish immigrant mother, John Patrick and Ida (Glatt) McCarthy. The family was obliged to relocat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Herbert A
Herbert may refer to: People * Herbert (musician), a pseudonym of Matthew Herbert * Herbert (given name) * Herbert (surname) Places Antarctica * Herbert Mountains, Coats Land * Herbert Sound, Graham Land Australia * Herbert, Northern Territory, a rural locality * Herbert, South Australia. former government town * Division of Herbert, an electoral district in Queensland * Herbert River, a river in Queensland * County of Herbert, a cadastral unit in South Australia Canada * Herbert, Saskatchewan, Canada, a town * Herbert Road, St. Albert, Canada New Zealand * Herbert, New Zealand, a town * Mount Herbert (New Zealand) United States * Herbert, Illinois, an unincorporated community * Herbert, Michigan, a former settlement * Herbert Creek, a stream in South Dakota * Herbert Island, Alaska Arts, entertainment, and media Fictional entities * Herbert (Disney character) * Herbert Pocket, a character in the Charles Dickens novel ''Great Expectations'' * Herbert West ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Allen Newell
Allen Newell (March 19, 1927 – July 19, 1992) was an American researcher in computer science and cognitive psychology at the RAND Corporation and at Carnegie Mellon University's School of Computer Science, Tepper School of Business, and Department of Psychology. He, Herbert A. Simon, and Cliff Shaw contributed to the Information Processing Language (1956) and two of the earliest AI programs, the Logic Theorist (1956) and the General Problem Solver (1957). He and Simon were awarded the ACM's A.M. Turing Award in 1975 for their contributions to artificial intelligence and the psychology of human cognition. Early studies Newell completed his bachelor's degree in physics from Stanford in 1949. He was a graduate student at Princeton University from 1949 to 1950, where he studied mathematics. Due to his early exposure to an unknown field known as game theory and the experiences from the study of mathematics, he was convinced that he would prefer a combination of experime ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minimax
Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics, and philosophy for ''minimizing'' the possible loss function, loss for a Worst-case scenario, worst case (''max''imum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty. Game theory In general games The maximin value is the highest value that the player can be sure to get without knowing the actions of the other players; equivalently, it is the lowest value the other players can force the player to receive when they know the player's action. Its formal definition is: :\underline = \max_ \min_ W ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Method Of Four Russians
In computer science, the Method of Four Russians or "The Four-Russians speedup," is a technique for speeding up algorithms involving Boolean matrices, or more generally algorithms involving matrices in which each cell may take on only a bounded number of possible values. Idea The main idea of the method is to partition the matrix into small square blocks of size for some parameter , and to use a lookup table to perform the algorithm quickly within each block. The index into the lookup table encodes the values of the matrix cells on the upper left of the block boundary prior to some operation of the algorithm, and the result of the lookup table encodes the values of the boundary cells on the lower right of the block after the operation. Thus, the overall algorithm may be performed by operating on only blocks instead of on matrix cells, where is the side length of the matrix. In order to keep the size of the lookup tables (and the time needed to initialize them) sufficiently sm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
