By Topic

Using directed hill-climbing for the construction of difference triangle sets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Koubi, S. ; Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. Johns, Nfld., Canada ; Mata-Montero, M. ; Shalaby, N.

This correspondence describes the use of the directed hill-climbing algorithm for finding improved upper bounds of difference triangle sets.

Published in:

Information Theory, IEEE Transactions on  (Volume:51 ,  Issue: 1 )