16082 search results - page 194 / 3217 » Fireworks Algorithm for Optimization |
114
click to vote
LREC
2010
15 years 4 months ago
2010
In this paper, we propose classifier ensemble selection for Named Entity Recognition (NER) as a single objective optimization problem. Thereafter, we develop a method based on gen...
142
click to vote
UAI
1998
15 years 4 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
120
click to vote
ICGA
1993
15 years 4 months ago
1993
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
153
click to vote
CSC
2009
15 years 4 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
137
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...