Sciweavers

3613 search results - page 445 / 723
» Estimating costs of a service
Sort
View
FOCS
1991
IEEE
15 years 10 months ago
A parallel algorithmic version of the Local Lemma
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
Noga Alon
FLAIRS
2008
15 years 9 months ago
On Using SVM and Kolmogorov Complexity for Spam Filtering
As a side effect of e-marketing strategy the number of spam e-mails is rocketing, the time and cost needed to deal with spam as well. Spam filtering is one of the most difficult t...
Sihem Belabbes, Gilles Richard
WSC
2007
15 years 9 months ago
Feasibility study of variance reduction in the logistics composite model
The Logistics Composite Model (LCOM) is a stochastic, discrete-event simulation that relies on probabilities and random number generators to model scenarios in a maintenance unit ...
George P. Cole III, Alan W. Johnson, J. O. Miller
CCGRID
2008
IEEE
15 years 8 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
CG
2008
Springer
15 years 8 months ago
Whole-History Rating: A Bayesian Rating System for Players of Time-Varying Strength
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
Rémi Coulom