Sciweavers

2006 search results - page 256 / 402
» Heuristic Security-Testing Methods
Sort
View
ECIS
2003
15 years 2 months ago
Towards definitive benchmarking of algorithm performance
One of the primary methods employed by researchers to judge the merits of new heuristics and algorithms is to run them on accepted benchmark test cases and comparing their perform...
Andrew Lim, Wee-Chong Oon, Wenbin Zhu
112
Voted
NIPS
2001
15 years 2 months ago
Constructing Distributed Representations Using Additive Clustering
If the promise of computational modeling is to be fully realized in higherlevel cognitive domains such as language processing, principled methods must be developed to construct th...
Wheeler Ruml
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 1 months ago
Voronoi-initializated island models for solving real-coded deceptive problems
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
Santiago Muelas, José Manuel Peña, V...
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 1 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
119
Voted
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 1 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein