Nie jesteś zalogowany |
EXTENSIONS OF DYNAMIC PROGRAMMING FOR COMBINATORIAL OPTIMIZATION
- Prelegent(ci)
- Mikhail Moshkov
- Afiliacja
- KAUST
- Termin
- 6 czerwca 2014 15:45
- Pokój
- p. 5440
- Seminarium
- Seminarium badawcze Zakładu Logiki: Wnioskowania aproksymacyjne w eksploracji danych
The aim of usual Dynamic
Programming (DP) is to find an optimal object from a finite set
of objects. We
consider extensions of DP which allow us (i) to describe the set
of optimal
objects, (ii) to count the number of these objects, (iii) to
make sequential
optimization relative to different criteria, (iv) to find the
set of Pareto
optimal points for two criteria, and (v) to describe
relationships between two
criteria. The areas of applications include discrete
optimization, fault
diagnosis, complexity of algorithms, machine learning, and
knowledge
representation.
