1193 search results - page 153 / 239 » A primer of simple theories |
190
Voted
ECML
2007
Springer
16 years 1 months ago
2007
Springer
Boosting is a simple yet powerful modeling technique that is used in many machine learning and data mining related applications. In this paper, we propose a novel scale-space based...
175
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Tournament selection has been widely used and studied in evolutionary algorithms. To supplement the study of tournament selection, this paper provides several models describing th...
185
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
193
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...
189
Voted
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...