Sciweavers

4526 search results - page 391 / 906
» Algorithmic problems related to the Internet
Sort
View
CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
15 years 11 months ago
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park,...
153
Voted
PPSN
2000
Springer
15 years 10 months ago
Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
Carlos Cotta, José M. Troya
ECAI
2008
Springer
15 years 8 months ago
Single-peaked consistency and its complexity
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
Bruno Escoffier, Jérôme Lang, Meltem ...
ICGA
1997
86views Optimization» more  ICGA 1997»
15 years 8 months ago
Performance of Diploid Dominance with Genetically Synthesized Signal Processing Networks
A methodology is described for synthesizing signal processing networks, which are used to solve a low-cost medical signal processing problem. The approach makes use of genetic alg...
F. Greene
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 6 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin