You are not logged in | Log in

PL /
EN

Speaker(s): Mikhail Moshkov
Affiliation: KAUST, Saudi Arabia
Date: Oct. 29, 2010, 2:15 p.m.
Room: room 5820
Seminar: Seminarium badawcze Zakładu Logiki: Wnioskowania aproksymacyjne w eksploracji danych

We consider extensions of Dynamic Programming which can work with problems containing exponential number of subproblems, and allow sequential optimization relative to different criteria and inference of relationships among these criteria. We use these extensions to study and optimize exact and approximate decision trees and rules.

Initiative of Excellence – Research University