2089 search results - page 87 / 418 » A New Problem in String Searching |
DAM
2008
14 years 10 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
112
click to vote
JPDC
2002
14 years 9 months ago
2002
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
HEURISTICS
2008
14 years 10 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
102
click to vote
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
TSP
2010
14 years 4 months ago
2010
A parametric generalized likelihood ratio test (GLRT) for multichannel signal detection in spatially and temporally colored disturbance was recently introduced by modeling the dist...