Sciweavers

789 search results - page 85 / 158
» Genetic algorithm can optimize hierarchical menus
Sort
View
CVPR
2004
IEEE
14 years 10 months ago
Multigrid and Multi-Level Swendsen-Wang Cuts for Hierarchic Graph Partition
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
Adrian Barbu, Song Chun Zhu
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
14 years 1 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
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
14 years 1 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
GECCO
2003
Springer
14 years 1 months ago
Effective Use of Directional Information in Multi-objective Evolutionary Computation
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient informa...
Martin Brown, Robert E. Smith