background preloader

Intro to AI - Introduction to Artificial Intelligence - Oct-Dec 2011

All of AI Class is now available through Udacity along with many other classes! This site ( will redirect to starting in February 2013. Class has ended, but you can still log in here. Sign in I'm greatly enjoying the class and amazed by how much I was able to learn in one month. Signing up for this class was probably one of the best (if not the best) decisions I made this year!

Related:  Personal/Virtual Learning Environment (PLE/VLE)

Anthropologists find American heads are getting larger White Americans' heads are getting bigger. That's according to research by forensic anthropologists at the University of Tennessee, Knoxville. Lee Jantz, coordinator of UT's Forensic Anthropology Center (FAC); Richard Jantz, professor emeritus and former director of the FAC; and Joanne Devlin, adjunct assistant professor, examined 1,500 skulls dating back to the mid-1800s through the mid-1980s.

School of Open Learn open practices at School of Open. Why "open"? Universal access to and participation in research, education, and culture is made possible by openness, but not enough people know what it means or how to take advantage of it. We hear about Open Source Software, Open Educational Resources, and Open Access… But what are these movements, who are their communities, and how do they work? Heuristics A*’s ability to vary its behavior based on the heuristic and cost functions can be very useful in a game. The tradeoff between speed and accuracy can be exploited to make your game faster. For most games, you don’t really need the best path between two points. You just need something that’s close. What you need may depend on what’s going on in the game, or how fast the computer is. Suppose your game has two types of terrain, Flat and Mountain, and the movement costs are 1 for flat land and 3 for mountains, A* is going to search three times as far along flat land as it does along mountainous land.

The Chess Master and the Computer by Garry Kasparov Chess Metaphors: Artificial Intelligence and the Human Mind by Diego Rasskin-Gutman, translated from the Spanish by Deborah Klosky MIT Press, 205 pp., $24.95 In 1985, in Hamburg, I played against thirty-two different chess computers at the same time in what is known as a simultaneous exhibition. Free Classes. Awesome Instructors. Inspiring Community. When does the course begin? This class is self paced. You can begin whenever you like and then follow your own pace. It’s a good idea to set goals for yourself to make sure you stick with the course. Fixing Cognitive Distortions Cognitive distortions have a way of playing havoc with our lives. If we let them. This kind of “stinkin’ thinkin’” can be “undone,” but it takes effort and lots of practice — every day. If you want to stop the irrational thinking, you can start by trying out the exercises below. 1.

8,200+ Strong, Researchers Band Together To Force Science Journals To Open Access Evolutionary biologist Michael Eisen made this t-shirt design in support of the Elsevier boycott. Academic research is behind bars and an online boycott by 8,209 researchers (and counting) is seeking to set it free…well, more free than it has been. The boycott targets Elsevier, the publisher of popular journals like Cell and The Lancet, for its aggressive business practices, but opposition was electrified by Elsevier’s backing of a Congressional bill titled the Research Works Act (RWA). Though lesser known than the other high-profile, privacy-related bills SOPA and PIPA, the act was slated to reverse the Open Access Policy enacted by the National Institutes of Health (NIH) in 2008 that granted the public free access to any article derived from NIH-funded research.

Sliding Blocks Solver by George Mitsuoka by George Mitsuoka October 17, 2011 This is my attempt to use the A* algorithm taught in the Stanford online AI class to solve the sliding blocks puzzle. Rock's law Rock's law or Moore's second law, named for Arthur Rock, says that the cost of a semiconductor chip fabrication plant doubles every four years.[1] As of 2003, the price had already reached about 3 billion US dollars. Rock's law can be seen as the economic flipside to Moore's law; the latter is a direct consequence of the ongoing growth of the capital-intensive semiconductor industry—innovative and popular products mean more profits, meaning more capital available to invest in ever higher levels of large-scale integration, which in turn leads to creation of even more innovative products. The semiconductor industry has always been extremely capital-intensive, with ever-dropping manufacturing unit costs. Thus, the ultimate limits to growth of the industry will constrain the maximum amount of capital that can be invested in new products; at some point, Rock's Law will collide with Moore's Law.[2][3][4]

DARPA Grand Challenge (2005) The second driverless car competition of the DARPA Grand Challenge was a 212 km (132 mi) off-road course that began at 6:40am on October 8, 2005, near the California/Nevada state line. All but one of the 23 finalists in the 2005 race surpassed the 11.78 km (7.32 mi) distance completed by the best vehicle in the 2004 race. Five vehicles successfully completed the course: 6 Possible Roles For Teachers In A Personalized Learning Environment by Justin Marquis, Ph. D There is a mountain of speculation and debate about what school and learning will look like in the near future. Will education be online? Individualized?

Learning Materials DNA from the Beginning DNA from the Beginning is an animated tutorial on DNA, genes and heredity. The science behind each concept is explained using... see more DNA from the Beginning is an animated tutorial on DNA, genes and heredity. The science behind each concept is explained using animations related to DNA topics, an image gallery, video interviews, problems, biographies, and links related to DNA. 8-Puzzle with A* (A Star) C# Rather than Depth-First, Breadth-First is complete, which means it will find a solution if it exist. But the solution may be so long and we might need to decide which node to expand, which we don't; Assume that we are searching for a node with state 4, with regular BFS, (assuming 2 is the node that will be branching to) we need to create 7 nodes to find the node 4. But if our algorithm can see that, branching to node 3 at the first point, is better than branching to 2, because if we branch to 2, we will need to create two extra nodes, which means performance loss. But how is an BFS algorithm can decide which node to branch? If an algorithm is able to decide to perform an action than performing another action, it uses a heuristic function.

Curso bajo la modalidad MOOC (en línea, masivo y abierto), auspiciado por la prestigiosa Universidad de Stanford y a cargo de los profesores Peter Norvig y Sebastian Thrun, de reconocida fama mundial. Esta experiencia masiva reúne a más de 160000 estudiantes de casi 200 países y es gratuita. La modalidad MOOC permitiría ofrecer maestrías en Stanford por unos 2000 $, algo impensable en un esquema presencial convencional, e impulsada por el movimiento de Apertura Mundial. by larrylugo Nov 5

Related:  CasesMOOC ProvidersA.I.N.AmericaInformatiqueE-RESEARCH E REDES SOCIAIS