DocumentCode :
1204776
Title :
Using directed hill-climbing for the construction of difference triangle sets
Author :
Koubi, Sharon ; Mata-Montero, Manrique ; Shalaby, Nabil
Author_Institution :
Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. Johns, Nfld., Canada
Volume :
51
Issue :
1
fYear :
2005
Firstpage :
335
Lastpage :
339
Abstract :
This correspondence describes the use of the directed hill-climbing algorithm for finding improved upper bounds of difference triangle sets.
Keywords :
combinatorial mathematics; information theory; optimisation; random number generation; combinatorial design; difference packing; difference triangle set construction; directed hill-climbing algorithm; upper bound; Computer science; Data communication; Linear programming; Mathematics; Statistics; Upper bound; Writing;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2004.839525
Filename :
1377513
Link To Document :
بازگشت