arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.3498cs.NEcs.SI
收藏

我们可以从无限半径搜索算法的自适应慢速行走中学到什么?

What can we learn from slow self-avoiding adaptive walks by an infinite radius search algorithm?

Susan Khor

摘要:

缓慢的自避免自适应行走的无限半径搜索算法(Limax)进行了分析,作为自己,作为网络,他们形成。对几个NK问题和两个HIFF问题进行了研究。我们发现,检查这样的“懒汉”散步和网络可以表明相对搜索困难的家庭内的问题,帮助确定潜在的局部最优,并检测存在的结构,健身景观。分层步行用于区分高低不平的景观是分层的(如HIFF)从那些是无政府状态(如NK)。引入节点粘性作为局部最优势的度量,发现它是相当成功的,尽管在K较大的问题上,它的精度还需要做更多的工作。

英文摘要:

Slow self-avoiding adaptive walks by an infinite radius search algorithm (Limax) are analyzed as themselves, and as the network they form. The study is conducted on several NK problems and two HIFF problems. We find that examination of such "slacker" walks and networks can indicate relative search difficulty within a family of problems, help identify potential local optima, and detect presence of structure in fitness landscapes. Hierarchical walks are used to differentiate rugged landscapes which are hierarchical (e.g. HIFF) from those which are anarchic (e.g. NK). The notion of node viscidity as a measure of local optimum potential is introduced and found quite successful although more work needs to be done to improve its accuracy on problems with larger K.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑