Sciweavers

5592 search results - page 139 / 1119
» On Random Betweenness Constraints
Sort
View
FOCS
2010
IEEE
13 years 8 months ago
Black-Box Randomized Reductions in Algorithmic Mechanism Design
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
Shaddin Dughmi, Tim Roughgarden
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 5 months ago
Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes
—We investigate approximating joint distributions of random processes with causal dependence tree distributions. Such distributions are particularly useful in providing parsimoni...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
ENTCS
2008
101views more  ENTCS 2008»
13 years 10 months ago
On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation
We explore the relation between the stochastic semantic associated to stochastic Concurrent Constrain Programming (sCCP) and its fluid-flow approximation. Writing the master equat...
Luca Bortolussi
ACTA
1998
111views more  ACTA 1998»
13 years 10 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
SIAMJO
2010
125views more  SIAMJO 2010»
13 years 5 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang