5005 search results - page 426 / 1001 » The Design and Analysis of Parallel Algorithms |
157
click to vote
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...
180
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
144
click to vote
ICRA
1999
IEEE
15 years 11 months ago
1999
IEEE
We presentthe first configurationspacecomputationalgorithm for pairs of rigid parts that move along fixed spatial axes. The motivation is contactanalysisformechanical design of sp...
172
click to vote
AUSDM
2007
Springer
15 years 10 months ago
2007
Springer
Population based real-life datasets often contain smaller clusters of unusual sub-populations. While these clusters, called `hot spots', are small and sparse, they are usuall...
192
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...