600 search results - page 26 / 120 » Problems and results in extremal combinatorics - II |
CPM
2007
Springer
14 years 2 months ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achie...
SIGECOM
2003
ACM
14 years 1 months ago
2003
ACM
We consider the problem of designing mechanisms for online problems in which agents arrive over time and the mechanism is unaware of the agent until the agent announces her arriva...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
IWLCS
2005
Springer
14 years 1 months ago
2005
Springer
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...