Sciweavers

2597 search results - page 4 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
ARSCOM
2004
72views more  ARSCOM 2004»
13 years 7 months ago
Exponential lower bounds for the numbers of Skolem-type sequences
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 ...
G. K. Bennett, Mike J. Grannell, Terry S. Griggs
COCOON
2009
Springer
13 years 5 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
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...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 4 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
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...
Xuan-Chao Huang, Jay Cheng
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 4 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions
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-...
CORR
2012
Springer
179views Education» more  CORR 2012»
12 years 3 months ago
Distributional convergence for the number of symbol comparisons used by QuickSort
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...
James Allen Fill