Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
Let a Golomb ruler be a set {ai} of integers so that all the differences ai - aj, i ≠ j, are distinct. Let H (I, J) be the smallest n such that there are I disjoint Golomb rulers each containing J elements chosen from {1, 2, ⋯, n}. In 1990, Kløve gave a table of bounds on H(I, J). In this correspondence we improve and extend this table with results found by computer search. © 1998 IEEE.
Hendrik F. Hamann
InterPACK 2013
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007