Sciweavers

3357 search results - page 512 / 672
» Controlling Complexity
Sort
View
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
15 years 7 months ago
Genetic programming: parametric analysis of structure altering mutation techniques
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...
Alan Piszcz, Terence Soule
106
Voted
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
15 years 7 months ago
Towards an empirical measure of evolvability
Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for ...
Joseph Reisinger, Kenneth O. Stanley, Risto Miikku...
132
Voted
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 7 months ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 7 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed
IFIP
2005
Springer
15 years 7 months ago
A Logic for Analysing Subterfuge in Delegation Chains
Abstract. Trust Management is an approach to construct and interpret the trust relationships among public-keys that are used to mediate security-critical actions. Cryptographic cre...
Hongbin Zhou, Simon N. Foley