Aktiviteter pr. år
Abstract
The Viterbi algorithm is a classical example of a dynamic programming
algorithm, in which pruning reduces the search space drastically,
so that an otherwise exponential time complexity is reduced to linearity. The
central steps of the algorithm, expansion and pruning, can be expressed in
a concise and clear way in CHR, but additional control is needed in order
to obtain the desired time complexity. It is shown how auxiliary constraints,
called trigger constraints, can be applied to fine-tune the order of CHR rule
applications in order to reach this goal. It is indicated how properties such
as confluence can be useful for showing such optimized programs correct.
algorithm, in which pruning reduces the search space drastically,
so that an otherwise exponential time complexity is reduced to linearity. The
central steps of the algorithm, expansion and pruning, can be expressed in
a concise and clear way in CHR, but additional control is needed in order
to obtain the desired time complexity. It is shown how auxiliary constraints,
called trigger constraints, can be applied to fine-tune the order of CHR rule
applications in order to reach this goal. It is indicated how properties such
as confluence can be useful for showing such optimized programs correct.
| Originalsprog | Engelsk |
|---|---|
| Titel | Proceeedings of the 7th International Workshop on Constraint Handling Rules |
| Redaktører | Peter Van Weert, Leslie De Koninck |
| Antal sider | 7 |
| Udgivelsessted | Leuven, Belgium |
| Forlag | Katholieke Universiteit Leuven |
| Publikationsdato | maj 2010 |
| Sider | 17-24 |
| Status | Udgivet - maj 2010 |
Aktiviteter
- 1 Deltagelse i workshop, seminar og kursus
-
CHR 2010: Seventh International Workshop on Constraint Handling Rules
Theil-Have, C. (Deltager)
20 jul. 2010Aktivitet: Deltagelse i eller arrangering af en begivenhed › Deltagelse i workshop, seminar og kursus