The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Previous Page 2

Displaying 21 – 29 of 29

Showing per page

Bottom-up learning of hierarchical models in a class of deterministic POMDP environments

Hideaki Itoh, Hisao Fukumoto, Hiroshi Wakuya, Tatsuya Furukawa (2015)

International Journal of Applied Mathematics and Computer Science

The theory of partially observable Markov decision processes (POMDPs) is a useful tool for developing various intelligent agents, and learning hierarchical POMDP models is one of the key approaches for building such agents when the environments of the agents are unknown and large. To learn hierarchical models, bottom-up learning methods in which learning takes place in a layer-by-layer manner from the lowest to the highest layer are already extensively used in some research fields such as hidden...

Bouquets of circles for lamination languages and complexities

Philippe Narbel (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Laminations are classic sets of disjoint and non-self-crossing curves on surfaces. Lamination languages are languages of two-way infinite words which code laminations by using associated labeled embedded graphs, and which are subshifts. Here, we characterize the possible exact affine factor complexities of these languages through bouquets of circles, i.e. graphs made of one vertex, as representative coding graphs. We also show how to build families of laminations together with corresponding lamination...

Currently displaying 21 – 29 of 29

Previous Page 2