Meeting Point

Na teto strance najdete programy a terminy seminaru. Seminare se konaji cca jednou za mesic v pracovne Dr. Bartaka (budova MFF UK, Malostranske namesti, 3. patro vlevo, dvere c. 51)

Seminar 23. 5. 2000
  • Hierarchie omezujicich podminek/Reseni prilis omezenych problemu (Tomas Kasl)
    • [M.Henz, L.Y.Fong, L.S.Chong, S.X.Ping, J.P.Walser, R.H.C.Yap: Solving Hierarchical Constrains over Finite Domains, Proceedings of the Sixth International Symposium on Artificial Intelligence and Mathematics, 2000, WWW]
    • [Richard J. Wallace and Eugene C. Freuder: Heuristic methods for over-constrained constraint satisfaction problems, in Over-Constrained Systems, M. Jampel, E.C. Freuder and M. Maher, editors. LNCS 1106,Berlin, Springer-Verlag, WWW]
  • Constraint Handling Rules (Lukas Rypacek) [WWW link]
Seminar 18. 4. 2000
  • Algoritmy systematickeho prohledavani (Richard Michalsky)
    • [M. Ginsberg: Partition Search, AAAI96]
    • [M. Ginsberg, W. Harvey: Limited Discrepancy Search, IJCAI95]
    • [M. Ginsberg: Panel on constraint satisfaction, IJCAI95]
    • [M. Ginsberg: Dynamic backtracking, JAIR, 1993]
    • [M. Ginsberg WWW]
  • Algoritmy lokalniho prohledavani a jejich specialni pripady (Tomas Muller)
Seminar 14. 3. 2000
  • Temporal Constraints (Roman Mecl)
    • [Schwalb, E.;Vila, L.: Temporal Constraints: A Survey, in: Contraints, Number 2, pp. 129-149, 1998]
  • Globalni podminka all_different (Petr Vilim)
    • [Regin, J.-Ch.: A filtering algorithm for constraints of difference in CSPs, Research Report, LIRM, Universite Montpellier, December 1993]
Seminar 15. 2. 2000
  • predstaveni Students Diploma Portal (Roman Bartak)
  • Prostredi pro navrh uzivatelskych rozhrani AMULET (Petr Vilim) [WWW link]
  • Prehled Programovani s omezujicimi podminkami (Roman Bartak) [PowerPoint]
Seminar 11. 1. 2000
  • strucne predstaveni temat jednotlivych diplomovych praci