12.07.2015 Views

Zriadenie Fakulty informatiky a informačných technológií - FIIT STU

Zriadenie Fakulty informatiky a informačných technológií - FIIT STU

Zriadenie Fakulty informatiky a informačných technológií - FIIT STU

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Annual report 2009 93an extended method. In this work, multi level weighting and weightingin general, feature filtering based on selected structural featurepresence or absence and additional analysis based on a lexicographicaldistance between design pattern terminology and identified instanceterminology were designed and prototyped. Extended methodwas experimentally tested on more than 3000 classes of open sourcesystems from different software engineering areas. Based on the testresults, the general conclusion for designed extensions was formulated.Student name: Marián LekavýDegree program: Applied InformaticsThesis title: Planning and ReschedulingSupervisor: Pavol Návrat, ProfessorDefended on: March 25, 2009Annotation: This thesis presents results in two areas. The first area is automatedplanning. Approaches to domain-independent automated planning canbe divided into two groups: STRIPS-like planning (based on operators)and HTN-like planning (based on hierarchical decomposition). Itis widely believed, that the expressivity of STRIPS-like planning islower than the expressivity of HTN-like planning. This would meanthat HTN-like planning can solve more problems than STRIPS-likeplanning. We show, that the expressivity of both approaches is identicaland that both approaches can solve all problems solvable by a finitetape Turing machine (i.e. solvable by a common computer). Thesecond part of this thesis addresses rescheduling. If we have a schedulewith unmovable deadline, we need to react on late activities byshortening of the remaining schedule part. In this thesis, we show thatevery rescheduling corresponds to a graph cut or the superposition ofseveral graph cuts. Based on this fact, we designed a new algorithmfor the cheapest rescheduling. The algorithm is based on the conversionof the rescheduling problem to the problem of minimal graphcut.9.4 Research LaboratoriesIntelligent Systems LaboratoryManager: P. NávratContact:pavol.navrat@stuba.skDescription: The laboratory is used for research of a wide spectrum of problemsthat fall into the field of program and information systems mainly inthe scope of artificial intelligence. The projects solved are concernedwith the methods of knowledge system development with a specialfocus on multi-agent systems and their collaboration, as well as intelligentsearch, delivery, and presentation of heterogeneous informationin a distributed environment such as Internet, including categorisationand recommendation of the information. The laboratory is equippedwith fairly powerful computer systems and advanced software toolsthat correspond to the demands of the projects being solved.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!