Computing the moments of <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time-Reference-Cited by-同舟云学术

Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time

Author:

Sutton Andrew M.,Darrell Whitley L.,Howe Adele E.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference25 articles.

2. Albert D. Bethke, Genetic Algorithms as Function Optimizers. Ph.D. Thesis, University of Michigan, 1980.

3. Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions;Choi,2008

5. Genetic algorithms and Walsh functions;Goldberg;Complex Systems,1989

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献