Sciweavers

903 search results - page 40 / 181
» Non-well-founded trees in categories
Sort
View
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
15 years 5 months ago
Multi-level genetic algorithm (MLGA) for the construction of clock binary tree
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
Guofang Nan, Minqiang Li, Jisong Kou
WWW
2006
ACM
16 years 15 days ago
Tables and trees don't mix (very well)
There are principal differences between the relational model and XML's tree model. This causes problems in all cases where information from these two worlds has to be brought...
Erik Wilde
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 6 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
SAC
2006
ACM
15 years 5 months ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
15 years 5 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener