Sciweavers

15494 search results - page 2865 / 3099
» Computing dynamic clusters
Sort
View
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
HIJ
2008
82views more  HIJ 2008»
15 years 6 months ago
Supporting grid-based clinical trials in Scotland
As clinical trials and medical population studies grow in size and complexity, a computational infrastructure that can underpin such studies is highly desirable. This should addre...
Richard O. Sinnott, A. J. Stell, Oluwafemi Ajayi
IANDC
2008
84views more  IANDC 2008»
15 years 6 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
CAL
2006
15 years 6 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani
CCR
2006
81views more  CCR 2006»
15 years 6 months ago
LTCP: improving the performance of TCP in highspeed networks
In this paper, we propose Layered TCP (LTCP for short), a set of simple modifications to the congestion window response of TCP to make it more scalable in highspeed networks. LTCP...
Sumitha Bhandarkar, Saurabh Jain, A. L. Narasimha ...
« Prev « First page 2865 / 3099 Last » Next »