Coffman E.G.

E.G. Coffman

Information about the author E.G. Coffman will soon be added to the site.
Found 18 papers in total
Approximation algorithms for extensible bin packing
Approximation algorithms for extensible bin packing
2006
In a variation of bin packing called extensible bin packing, the number of bins is...
Performance of the move-to-front algorithm with Markov-modulated request sequences
Performance of the move-to-front algorithm with Markov-modulated request sequences
1999
We study the classical move-to-front (MTF) algorithm for self-organizing lists within...
Polling systems in heavy traffic: A Bessel process limit
Polling systems in heavy traffic: A Bessel process limit
1998
This paper studies the classical polling model under the exhaustive-service...
Perfect packing theorems and the average-case behavior of optimal and online bin packing
Perfect packing theorems and the average-case behavior of optimal and online bin packing
2002
We consider the one-dimensional bin packing problem under the discrete uniform...
Stochastic limit laws for schedule makespans
Stochastic limit laws for schedule makespans
1996
A basic multiprocessor version of the makespan scheduling problem requires that n...
Computing call admission capacities in linear networks
Computing call admission capacities in linear networks
1999
We study call admission rates in a linear communication network with each call...
Optimal robot scheduling for Web search engines
Optimal robot scheduling for Web search engines
1998
A robot is deployed by a Web search engine in order to maintain the currency of its...
Redialling policies: Optimality and success probabilities
Redialling policies: Optimality and success probabilities
1999
Since callers encountering busy signals often want to redial, modern communication...
Stochastic limit laws for schedule makespans
Stochastic limit laws for schedule makespans
1996
A basic multiprocessor version of the makespan scheduling problem requires that n...
A distributed clustering process
A distributed clustering process
1991
The points of a graph G will form clusters as a result of a flow process. Initially,...
On the optimal stochastic scheduling of out-forests
On the optimal stochastic scheduling of out-forests
1992
This paper presents new results on the problem of scheduling jobs on K≥1 parallel...
First-fit allocation of queues: Tight probabilistic bounds on wasted space
First-fit allocation of queues: Tight probabilistic bounds on wasted space
1990
The authors analyze a dynamic queue-storage problem where the arrival and departure...
Height distributions in data communications buffers with locking protocols
Height distributions in data communications buffers with locking protocols
1991
This paper analyzes a stochastic model of data communication. Messages are entered in...
Batch sizing and job sequencing on a single machine
Batch sizing and job sequencing on a single machine
1990
The authors study a single-machine scheduling problem in which the items to be...
Largest-first sequential selection with a sum constraint
Largest-first sequential selection with a sum constraint
1990
Scan the order statistics XÅ( 1 Å)≥XÅ( 2...
Average-case analysis of cutting and packing in two dimensions
Average-case analysis of cutting and packing in two dimensions
1990
Stock-cutting and packing in two dimensions is a source of problems of great practical...
A provably efficient algorithm for dynamic storage allocation
A provably efficient algorithm for dynamic storage allocation
1989
The design and analysis of algorithms for on-line dynamic storage allocation has been...
Algorithms for packing squares: A probabilistic analysis
Algorithms for packing squares: A probabilistic analysis
1989
This paper gives a probabilistic performance analysis of simple algorithms for packing...
Papers per page: