Sciweavers

512 search results - page 59 / 103
» On Evolutionary Optimization of Large Problems Using Small P...
Sort
View
IVS
2002
106views more  IVS 2002»
15 years 4 days ago
Pixel bar charts: a visualization technique for very large multi-attribute data sets?
Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data presenting only a very small number of data values (as in the case of bar charts) ...
Daniel A. Keim, Ming C. Hao, Umeshwar Dayal, Meich...
KBS
2006
87views more  KBS 2006»
15 years 12 days ago
Predictive and comprehensible rule discovery using a multi-objective genetic algorithm
We present a multi-objective genetic algorithm for mining highly predictive and comprehensible classification rules from large databases. We emphasize predictive accuracy and comp...
Satchidananda Dehuri, Rajib Mall
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 17 days ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
113
Voted
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
15 years 6 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 4 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch