| dc.contributor.author | Lozano-Perez, Tomas | en_US |
| dc.contributor.author | Kaelbling, Leslie Pack | en_US |
| dc.contributor.author | Winston, Patrick Henry | en_US |
| dc.coverage.temporal | Spring 2003 | en_US |
| dc.date.issued | 2003-06 | |
| dc.identifier | 6.034-Spring2003 | |
| dc.identifier | local: 6.034 | |
| dc.identifier | local: IMSCP-MD5-16649f75bb3c0a3ac45a797712437ff3 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/35799 | |
| dc.description.abstract | Introduces representations, techniques, and architectures used to build applied systems and to account for intelligence from a computational point of view. Applications of rule chaining, heuristic search, constraint propagation, constrained search, inheritance, and other problem-solving paradigms. Applications of identification trees, neural nets, genetic algorithms, and other learning paradigms. Speculations on the contributions of human vision and language systems to human intelligence. Enrollment may be limited. | en_US |
| dc.format.extent | 14533 bytes | en_US |
| dc.format.extent | 31429 bytes | en_US |
| dc.format.extent | 42329 bytes | en_US |
| dc.format.extent | 14718 bytes | en_US |
| dc.format.extent | 12655 bytes | en_US |
| dc.format.extent | 13783 bytes | en_US |
| dc.format.extent | 11 bytes | en_US |
| dc.format.extent | 4586 bytes | en_US |
| dc.format.extent | 21366 bytes | en_US |
| dc.format.extent | 11602 bytes | en_US |
| dc.format.extent | 38351 bytes | en_US |
| dc.format.extent | 4755 bytes | en_US |
| dc.format.extent | 27322 bytes | en_US |
| dc.format.extent | 25313 bytes | en_US |
| dc.format.extent | 4039 bytes | en_US |
| dc.format.extent | 301 bytes | en_US |
| dc.format.extent | 354 bytes | en_US |
| dc.format.extent | 339 bytes | en_US |
| dc.format.extent | 180 bytes | en_US |
| dc.format.extent | 285 bytes | en_US |
| dc.format.extent | 67 bytes | en_US |
| dc.format.extent | 17685 bytes | en_US |
| dc.format.extent | 49 bytes | en_US |
| dc.format.extent | 143 bytes | en_US |
| dc.format.extent | 247 bytes | en_US |
| dc.format.extent | 19283 bytes | en_US |
| dc.format.extent | 262 bytes | en_US |
| dc.format.extent | 74118 bytes | en_US |
| dc.format.extent | 144967 bytes | en_US |
| dc.format.extent | 4235385 bytes | en_US |
| dc.format.extent | 1855179 bytes | en_US |
| dc.format.extent | 2139426 bytes | en_US |
| dc.format.extent | 2936831 bytes | en_US |
| dc.format.extent | 2143453 bytes | en_US |
| dc.format.extent | 1287912 bytes | en_US |
| dc.format.extent | 2831333 bytes | en_US |
| dc.format.extent | 3775627 bytes | en_US |
| dc.format.extent | 1672738 bytes | en_US |
| dc.format.extent | 1187533 bytes | en_US |
| dc.format.extent | 1414016 bytes | en_US |
| dc.format.extent | 2383732 bytes | en_US |
| dc.format.extent | 236909 bytes | en_US |
| dc.format.extent | 261429 bytes | en_US |
| dc.format.extent | 206859 bytes | en_US |
| dc.format.extent | 50404 bytes | en_US |
| dc.format.extent | 59703 bytes | en_US |
| dc.format.extent | 139530 bytes | en_US |
| dc.format.extent | 19283 bytes | en_US |
| dc.format.extent | 3486 bytes | en_US |
| dc.format.extent | 811 bytes | en_US |
| dc.format.extent | 813 bytes | en_US |
| dc.format.extent | 830 bytes | en_US |
| dc.format.extent | 563 bytes | en_US |
| dc.format.extent | 2097 bytes | en_US |
| dc.format.extent | 31665 bytes | en_US |
| dc.format.extent | 8540 bytes | en_US |
| dc.format.extent | 8951 bytes | en_US |
| dc.format.extent | 8496 bytes | en_US |
| dc.format.extent | 8496 bytes | en_US |
| dc.format.extent | 8506 bytes | en_US |
| dc.format.extent | 8640 bytes | en_US |
| dc.format.extent | 8493 bytes | en_US |
| dc.format.extent | 8494 bytes | en_US |
| dc.format.extent | 8503 bytes | en_US |
| dc.format.extent | 8869 bytes | en_US |
| dc.format.extent | 7977 bytes | en_US |
| dc.format.extent | 8495 bytes | en_US |
| dc.format.extent | 8498 bytes | en_US |
| dc.format.extent | 8195 bytes | en_US |
| dc.format.extent | 8492 bytes | en_US |
| dc.format.extent | 8541 bytes | en_US |
| dc.format.extent | 8011 bytes | en_US |
| dc.format.extent | 8496 bytes | en_US |
| dc.format.extent | 8878 bytes | en_US |
| dc.format.extent | 8551 bytes | en_US |
| dc.format.extent | 8496 bytes | en_US |
| dc.format.extent | 8546 bytes | en_US |
| dc.format.extent | 8216 bytes | en_US |
| dc.format.extent | 8529 bytes | en_US |
| dc.format.extent | 8493 bytes | en_US |
| dc.format.extent | 7857 bytes | en_US |
| dc.language | en-US | en_US |
| dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en_US |
| dc.subject | artificial intelligence | en_US |
| dc.subject | applied systems | en_US |
| dc.subject | intelligence | en_US |
| dc.subject | rule chaining | en_US |
| dc.subject | heuristic search | en_US |
| dc.subject | logic | en_US |
| dc.subject | constraint propagation | en_US |
| dc.subject | constrained search | en_US |
| dc.subject | decision trees | en_US |
| dc.subject | neural nets | en_US |
| dc.subject | SVMs | en_US |
| dc.subject | problem-solving paradigms | en_US |
| dc.title | 6.034 Artificial Intelligence, Spring 2003 | en_US |
| dc.title.alternative | Artificial Intelligence | en_US |
| dc.type | Learning Object | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
