AI*IA 2005: Advances in Artificial Intelligence: 9th by Andrea Ferrara, Paolo Liberatore, Marco Schaerf (auth.),

By Andrea Ferrara, Paolo Liberatore, Marco Schaerf (auth.), Stefania Bandini, Sara Manzoni (eds.)

This quantity collects the papers chosen for presentation on the IX Congress of the Italian organization for Arti?cial Intelligence (AI*IA), held in Milan on the collage of Milano–Bicocca (September 21–23, 2005). at the one hand this congress maintains the culture of AI*IA in organizing its biannual s- enti?c assembly from 1989; nevertheless, this version is a landmark within the involvement of the foreign neighborhood of arti?cial intelligence (AI), at once related to a large variety of specialists from a number of nations within the P- gramCommittee. Moreover,the atypical nature of scienti?c researchin arti?cial intelligence (which is intrinsically overseas) and several other consolidated int- nationwide collaborations in tasks and mobility courses allowed the gathering and choice of papers from many di?erent international locations, all over the global, enlarging the visibility of the Italian contribution inside this learn ?eld. Arti?cial intelligence is this day a transforming into advanced set of conceptual, theor- ical, methodological, and technological frameworks, o?ering cutting edge com- tational recommendations within the layout and improvement of computer-based structures. inside this angle, researchers operating during this quarter needs to take on a huge diversity of data approximately equipment, effects, and ideas coming from di?erent classical parts of this self-discipline. The congress used to be designed as a discussion board permitting researchers to offer and speak about really good effects as normal contributions to AI growth.

Show description

Read or Download AI*IA 2005: Advances in Artificial Intelligence: 9th Congress of the Italian Association for Artificial Intelligence, Milan, Italy, September 21-32, 2005. Proceedings PDF

Best italian books

Additional info for AI*IA 2005: Advances in Artificial Intelligence: 9th Congress of the Italian Association for Artificial Intelligence, Milan, Italy, September 21-32, 2005. Proceedings

Example text

Log-scale on the y-axis has been used when necessary. respectively. , the instances with strong lattice/small-world topologies3. In some plots, we also observe that the instances corresponding to the maximal proximity ratio are the hardest on average4. Nevertheless, this behavior is not regular nor clear and the statistical correlation between search cost and proximity ratio is quite low. The peculiar behavior observed is a clear signal that different factors other than small-world topology affect algorithm behavior.

In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57, pages 321–353. Kluwer Academic Publishers, Norwell, MA, 2002. 8. D. G. Mitchell, B. Selman, and H. J. Levesque. Hard and easy distributions of SAT problems. In Proc. of AAAI92, pages 459–465. AAAI Press/MIT Press, July 1992. 9. Johnson. Computers and intractability; a guide to the theory of NPcompleteness. H. Freeman, 1979. 10. S. Prestwich and A. Roli. Symmetry breaking and local search spaces. In Proceedings of CPAIOR 2005, volume 3524 of Lecture Notes in Computer Science.

7. H. R. Lourenço, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57, pages 321–353. Kluwer Academic Publishers, Norwell, MA, 2002. 8. D. G. Mitchell, B. Selman, and H. J. Levesque. Hard and easy distributions of SAT problems. In Proc. of AAAI92, pages 459–465. AAAI Press/MIT Press, July 1992. 9. Johnson. Computers and intractability; a guide to the theory of NPcompleteness. H. Freeman, 1979. 10. S. Prestwich and A.

Download PDF sample

Rated 5.00 of 5 – based on 6 votes

About admin