Sciweavers

10899 search results - page 2167 / 2180
» Wide Area Computation
Sort
View
120
Voted
MP
2002
85views more  MP 2002»
15 years 1 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
MST
2002
107views more  MST 2002»
15 years 1 months ago
A Comparison of Asymptotically Scalable Superscalar Processors
The poor scalability of existing superscalar processors has been of great concern to the computer engineering community. In particular, the critical-path lengths of many components...
Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh
SIAMDM
1998
89views more  SIAMDM 1998»
15 years 1 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
SIAMDM
2002
94views more  SIAMDM 2002»
15 years 1 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
SIGCSE
2002
ACM
153views Education» more  SIGCSE 2002»
15 years 1 months ago
A communication library to support concurrent programming courses
A number of communication libraries have been written to support concurrent programming. For a variety of reasons, these libraries generally are not well-suited for use in undergr...
Steve Carr, Changpeng Fang, Tim Jozwowski, Jean Ma...
« Prev « First page 2167 / 2180 Last » Next »