2089 search results - page 73 / 418 » A New Problem in String Searching |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
EWCBR
2008
Springer
14 years 11 months ago
2008
Springer
"Similar problems have similar solutions" is a basic tenet of case-based inference. However this is not satisfied for CBR systems where the task is to achieve original so...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
154
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...