10493 search results - page 1 / 2099 » Dynamic Word Problems |
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
FSS
2002
13 years 6 months ago
2002
We formulate a stopping problem for dynamic fuzzy systems concerning with fuzzy decision environment. It could be regarded as a natural fuzzification of non-fuzzy stopping problem...
LREC
2010
13 years 8 months ago
2010
Conventional methods for disambiguation problems have been using statistical methods with co-occurrence of words in their contexts. It seems that human-beings assign appropriate w...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
TRANSCI
2011
13 years 1 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...