6719 search results - page 424 / 1344 » A Generalization of Automatic Sequences |
145
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the sli...
164
click to vote
EDM
2010
15 years 8 months ago
2010
This paper demonstrates the generality of the hidden Markov model approach for exploratory sequence analysis by applying the methodology to study students' learning behaviors ...
190
click to vote
COLING
2008
15 years 8 months ago
2008
This paper presents a general platform, namely synchronous tree sequence substitution grammar (STSSG), for the grammar comparison study in Translational Equivalence Modeling (TEM)...
175
click to vote
AAAI
2006
15 years 8 months ago
2006
We consider the iterated belief change that occurs following an alternating sequence of actions and observations. At each instant, an agent has some beliefs about the action that ...
155
click to vote
WSC
2004
15 years 8 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...