Sciweavers

2321 search results - page 164 / 465
» Optimizing WebPage Interest
Sort
View
111
Voted
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 8 months ago
Discovering event evidence amid massive, dynamic datasets
Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniq...
Robert M. Patton, Thomas E. Potok
IPPS
2005
IEEE
15 years 8 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
ECML
2005
Springer
15 years 8 months ago
Severe Class Imbalance: Why Better Algorithms Aren't the Answer
This paper argues that severe class imbalance is not just an interesting technical challenge that improved learning algorithms will address, it is much more serious. To be useful, ...
Chris Drummond, Robert C. Holte
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
15 years 8 months ago
Applying price's equation to survival selection
Several researchers have used Price’s equation (from biology theory literature) to analyze the various components of an Evolutionary Algorithm (EA) while it is running, giving i...
Jeffrey K. Bassett, Mitchell A. Potter, Kenneth A....
118
Voted
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
15 years 8 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic