454 search results - page 40 / 91 » On improving approximate solutions by evolutionary algorithm... |
106
click to vote
DAWAK
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
123
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
142
Voted
TMI
2002
15 years 1 months ago
2002
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
146
click to vote
IPCO
2008
15 years 3 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
TEC
2008
15 years 1 months ago
2008
Abstract--We present an algorithm that coevolves fitness predictors, optimized for the solution population, which reduce fitness evaluation cost and frequency, while maintaining ev...