3818 search results - page 117 / 764 » Word Problems on Compressed Words |
163
click to vote
IPL
2007
15 years 4 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
137
Voted
TCS
2008
15 years 4 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
140
click to vote
JSS
2007
15 years 4 months ago
2007
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-d...
182
Voted
NC
2002
15 years 4 months ago
2002
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
117
click to vote
TRANSCI
2011
14 years 12 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...