Sciweavers

789 search results - page 78 / 158
» Genetic algorithm can optimize hierarchical menus
Sort
View
CGF
2004
113views more  CGF 2004»
13 years 8 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
14 years 1 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 1 months ago
Exploring extended particle swarms: a genetic programming approach
Particle Swarm Optimisation (PSO) uses a population of particles that fly over the fitness landscape in search of an optimal solution. The particles are controlled by forces tha...
Riccardo Poli, Cecilia Di Chio, William B. Langdon
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
14 years 3 days ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
14 years 2 months ago
Signal-path driven partition and placement for analog circuit
This paper advances a new methodology based on signal-path information to resolve the problem of device-level placement for analog layout. This methodology is mainly based on three...
Di Long, Xianlong Hong, Sheqin Dong