Name
Abstract | ||
|---|---|---|
This paper looks at proofs concerning Gray codes and the locality of local search; it is shown that in some cases such proofs can be generalized to Binary and real valued encodings, while in other cases such proofs do not hold for Binary encodings. The paper also looks at a modified form of Quad Search that is proven to converge in under 2L evaluations to a global optimum on unimodal 1-D bijective functions and to a local optimum on multimodal 1-D bijective functions. Quad Search directly exploits the locality of the Gray code representation. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11513575_2 | FOGA |
Keywords | Field | DocType |
locality proof,modified form,gray code representation,quad search,binary encodings,1-d bijective function,gray code,local search | Discrete mathematics,Locality,Bijection,Local optimum,Computer science,Gray code,Mathematical proof,Local search (optimization),Genetic algorithm,Binary number | Conference |
Volume | ISSN | ISBN |
3469 | 0302-9743 | 3-540-27237-2 |
Citations | PageRank | References |
4 | 0.44 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. Darrell Whitley | 1 | 6631 | 968.30 |
| Jonathan E. Rowe | 2 | 458 | 56.35 |