It was shown by Abrham that the number of pure Skolem sequences of order n, n 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2 ...
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
George Karakostas, Stavros G. Kolliopoulos, Jing W...
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Jay Cheng, Cheng-Shang Chang, Sheng-Hua Yang, Tsz-...
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...