Sciweavers

3946 search results - page 424 / 790
» The computational complexity of choice sets
Sort
View
CEC
2010
IEEE
15 years 5 months ago
Beating the 'world champion' evolutionary algorithm via REVAC tuning
Abstract-- We present a case study demonstrating that using the REVAC parameter tuning method we can greatly improve the `world champion' EA (the winner of the CEC2005 competi...
Selmar K. Smit, A. E. Eiben
CIKM
2006
Springer
15 years 11 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
VIS
2007
IEEE
188views Visualization» more  VIS 2007»
16 years 8 months ago
Fast Filament Tracking Using Graphics Hardware
Recent developments in biomedical imaging are producing massive data sets containing structures, such as fine filaments, that are difficult to visualize. In this paper, we describ...
David M. Mayerich, Zeki Melek, John Keyser
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
15 years 8 months ago
Evolving machine microprograms
The realization of a control unit can be done using a complex circuitry or microprogramming. The latter may be considered as an alternative method of implementation of machine ins...
Pedro A. Castillo Valdivieso, G. Fernández,...
MST
2006
149views more  MST 2006»
15 years 7 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier