论文信息 - Anticipation in Robot Navigation and Mining for Intresting Patterns - 字舞流文

Anticipation in Robot Navigation and Mining for Intresting Patterns

We consider robot self-awareness from the point of view of temporal relation based data mining. We consider the problem of mining for intresting patterns. In particular, we study the longest common subsequence over the set problem.

Anna Gorbenko | Vladimir Popov

[1] A Ring Variety without an Independent Basis , 2001 .

[2] P. Lambin,et al. Theoretical phonon dispersion of armchair and metallic zigzag carbon nanotubes beyond the adiabatic approximation , 2010 .

[3] Decidability boundaries for some classes of nilpotent and solvable groups , 2000 .

[4] V. Popov. Equational Theories for Classes of Finite Semigroups , 2001 .

[5] On equational theories of varieties of anticommutative rings , 1999 .

[6] V. Popov. On Complexity of the Word Problem for Finitely Presented Commutative Semigroups , 2002 .

[7] John Newsome Crossley,et al. Algebra and Logic , 1975 .

[8] V. Y. Popov. The approximate period problem for DNA alphabet , 2003, Theor. Comput. Sci..

[9] The property of having independent basis in semigroup varieties , 2005 .

[10] The Word Problem for Relatively Free Semigroups , 2006 .

[11] On the Finite Base Property for Semigroup Varieties , 2002 .