Acceso identificado |
Material complementarioMaterial de prácticasLecturas recomendadas
AI's Hall of Fame, IEEE Intelligent Systems, July / August 2011, DOI 10.1109/MIS.2011.64
Material complementarioMaterial de prácticasLecturas recomendadas
Peter E. Hart, Nils J. Nilsson & Bertram Raphael:
A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics 4(2):100–107, 1968, DOI 10.1109/TSSC.1968.300136
Peter E. Hart, Nils J. Nilsson & Bertram Raphael:
Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths", SIGART Newsletter 37:28–29, 1972, DOI 10.1145/1056777.1056779
Material complementarioMaterial de prácticasLecturas recomendadas
Richard E. Fikes & Nils J. Nilsson:
STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2(3-4):189-208, 1971, DOI 10.1016/0004-3702(71)90010-5
Earl D. Sacerdoti:
Planning in a hierarchy of abstraction spaces, Artificial Intelligence 5(2):115-135, 1974, DOI 10.1016/0004-3702(74)90026-5
James Hendler, Austin Tate & and Mark Drummond:
AI Planning: Systems and Techniques, AI Magazine 11(2):61-77, 1990, URL http://www.aaai.org/ojs/index.php/aimagazine/article/view/833/751
Richard E. Fikes & Nils J. Nilsson:
STRIPS, a retrospective, Artificial Intelligence 59(1-2):227-232, 1993, DOI 10.1016/0004-3702(93)90190-M
Material de prácticasLecturas recomendadas
David Karger, Cliff Stein, Joel Wein:
Scheduling Algorithms,
Algorithms and Theory of Computation Handbook, Volume 2: Special Topics snd Techniques, chapter 20, Chapman & Hall / CRC Press, 2nd edition, 2010.
ISBN 978-1-58488-820-8, DOI 10.1201/9781584888215-c20
Sigrid Knust (original idea by Peter Brucker): Complexity results for scheduling problems, Universität Osnabrück, 2009.
URL http://www.informatik.uni-osnabrueck.de/knust/class/
Material complementario
|
©