Sciweavers

1028 search results - page 92 / 206
» Character sets of strings
Sort
View
DIS
2004
Springer
14 years 2 months ago
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö,...
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
14 years 2 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic
ICARIS
2004
Springer
14 years 2 months ago
Online Negative Databases
The benefits of negative detection for obscuring information are explored in the context of Artificial Immune Systems (AIS). AIS based on string matching have the potential for a...
Fernando Esponda, Elena S. Ackley, Stephanie Forre...
ICMCS
2000
IEEE
128views Multimedia» more  ICMCS 2000»
14 years 1 months ago
A Genetic Algorithm for Video Segmentation and Summarization
We describe a genetic segmentation algorithm for video. This algorithm operates on segments of a string representation. It is similar to both classical genetic algorithms that ope...
Patrick Chiu, Andreas Girgensohn, Wolfgang Polak, ...
STACS
1999
Springer
14 years 1 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...