446 search results - page 46 / 90 » Using a genetic algorithm approach to solve the dynamic chan... |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
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...
SAC
2006
ACM
13 years 8 months ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
GECCO
1999
Springer
14 years 1 months ago
1999
Springer
This paper describes the innovative use of genetic programming (GP) to solve the grasp synthesis problem for multifingered robot hands. The goal of our algorithm is to select a Ò...
WSCG
2003
13 years 10 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...