Preparata, F. P. (1974). Difference-preserving codes. IEEE Transactions on Information Theory, IT-20:5, September, 1974, 643--649.  Home/Search   Document Not in Database   Summary   Related Articles

.... is clearly and demonstrably difficult for local searchers (that is, algorithms 7 The problem of finding a maximally long path with minimal separation has some history, and is known as the snake inthe box problem, or the design of distance preserving codes, in the literature on combinatorics (Preparata, 1974). Maximizing the length of paths with k bits of separation is an open problem, even for k = 1. However, upper bounds have been found that are O(2 ) Thus the longest paths we can ever find will be O(2 =c ) for some constant c 1. For the Root2path, c = 2 for k = 1. In (Horn, Goldberg, and ....

....sphere packing with radius dk=2e Gamma 1 also provides an upper bound (within a factor of two) on the path length of (k Gamma 1) step long path problems, since nonconsecutive steps on the path must be at least k bits apart. However, tighter upper bounds on (k Gamma 1) step paths have been found (Preparata, 1974). 18 Like our maximally multimodal function, previous GA easy functions contain local optima that can make the problem difficult for hillclimbing. 19 It is interesting to note that according to our definition of local optimum, the Royal Road functions are unimodal. We look to deception for ....

Preparata, F. P. (1974). Difference-preserving codes. IEEE Transactions on Information Theory, IT-20:5, September, 1974, 643--649.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC