Displaying similar documents to “Solving Difficult LR Parsing Conflicts by Postponing Them”

Approximate dynamic programming based on high dimensional model representation

Miroslav Pištěk (2013)

Kybernetika

Similarity:

This article introduces an algorithm for implicit High Dimensional Model Representation (HDMR) of the Bellman equation. This approximation technique reduces memory demands of the algorithm considerably. Moreover, we show that HDMR enables fast approximate minimization which is essential for evaluation of the Bellman function. In each time step, the problem of parametrized HDMR minimization is relaxed into trust region problems, all sharing the same matrix. Finding its eigenvalue decomposition,...

Positioned agents in eco-grammar systems with border markers and pure regulated grammars

Miroslav Langer, Alica Kelemenová (2012)

Kybernetika

Similarity:

In this paper we follow our previous research in the field of positioned agents in the eco-grammar systems and pure grammars. We extend model of the positioned eco-grammar systems by boundary markers and we introduce bordered positioned eco-grammar systems (BPEG systems, for short) and that way we show one of the possible answers to the question stated in [9]. Namely we compare generative power of the BPEG systems with three types of pure regulated grammars with appearance checking. ...