Sciweavers

3818 search results - page 98 / 764
» Word Problems on Compressed Words
Sort
View
INFORMATICALT
2006
110views more  INFORMATICALT 2006»
15 years 4 months ago
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
Gintaras Palubeckis
111
Voted
SPIRE
2004
Springer
15 years 10 months ago
Linear Time Algorithm for the Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
DM
2008
58views more  DM 2008»
15 years 4 months ago
The vertex isoperimetric problem for the powers of the diamond graph
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
FSS
2002
96views more  FSS 2002»
15 years 4 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...
JCSS
2010
155views more  JCSS 2010»
15 years 3 months ago
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
Michael Dom, Jiong Guo, Rolf Niedermeier