648 search results - page 5 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
IJCAI
2003
13 years 9 months ago
2003
A new approach to the Text Categorization problem is here presented. It is called Gaussian Weighting and it is a supervised learning algorithm that, during the training phase, est...
FAW
2009
Springer
14 years 2 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
NN
2007
Springer
13 years 7 months ago
2007
Springer
The interval discrimination task is a classical experimental paradigm that is employed to study working memory and decision making and typically involves four phases. First, the s...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
EUROGP
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...