Sciweavers

10493 search results - page 1 / 2099
» Dynamic Word Problems
Sort
View
66
Voted
FOCS
1993
IEEE
15 years 2 months ago
Dynamic Word Problems
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...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...
FSS
2002
96views more  FSS 2002»
14 years 9 months ago
An approach to stopping problems of a dynamic fuzzy system
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...
Masami Kurano, Masami Yasuda, Jun-ichi Nakagami, Y...
LREC
2010
153views Education» more  LREC 2010»
14 years 11 months ago
Homographic Ideogram Understanding Using Contextual Dynamic Network
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...
Jun Okamoto, Shun Ishizaki
CORR
2007
Springer
113views Education» more  CORR 2007»
14 years 10 months ago
The road coloring problem
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...
A. N. Trahtman
TRANSCI
2011
80views more  TRANSCI 2011»
14 years 4 months ago
The Dynamic Uncapacitated Hub Location Problem
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...
Ivan Contreras, Jean-François Cordeau, Gilb...