【24h】

Gray, Binary and Real Valued Encodings: Quad Search and Locality Proofs

机译:灰色,二进制和实值编码:四边形搜索和位置证明

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:本文着眼于有关格雷码和本地搜索位置的证明;结果表明,在某些情况下,此类证明可以推广为二进制和实值编码,而在其他情况下,此类证明不适用于二进制编码。本文还着眼于四边形搜索的一种改进形式,它被证明可以在2L评估下收敛到单峰一维双射函数的全局最优值和多峰一维双射函数的局部最优值。 Quad搜索直接利用格雷码表示形式的局部性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号