Sciweavers

840 search results - page 40 / 168
» The Complexity of the Extended GCD Problem
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
Resource-aware allocation strategies for divisible loads on large-scale systems
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
Anne Benoit, Loris Marchal, Jean-Francois Pineau, ...
ML
2012
ACM
413views Machine Learning» more  ML 2012»
12 years 3 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
WWW
2002
ACM
14 years 8 months ago
Clarifying the fundamentals of HTTP
The simplicity of HTTP was a major factor in the success of the Web. However, as both the protocol and its uses have evolved, HTTP has grown complex. This complexity results in nu...
Jeffrey C. Mogul
PE
2002
Springer
132views Optimization» more  PE 2002»
13 years 7 months ago
Performance evaluation with temporal rewards
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
Jeroen Voeten
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 2 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...