1603 search results - page 121 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
153
click to vote
DIS
2004
Springer
15 years 11 months ago
2004
Springer
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...
144
click to vote
ANOR
2010
15 years 6 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
168
click to vote
FM
2005
Springer
15 years 12 months ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
182
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
187
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents an approach for classifying students in order to predict their final grade based on features extracted from logged data in an education web-based system. A comb...