Sciweavers

16404 search results - page 656 / 3281
» A set coverage problem
Sort
View
SIGECOM
2008
ACM
141views ECommerce» more  SIGECOM 2008»
15 years 7 months ago
On the communication requirements of verifying the VCG outcome
We consider the amount of communication required to verify the outcome of the Vickrey-Clarke-Groves (VCG) mechanism: an efficient allocation together with incentivizing VCG paymen...
Sébastien Lahaie, David C. Parkes
AUTOMATICA
2000
89views more  AUTOMATICA 2000»
15 years 7 months ago
Interval constraint propagation with application to bounded-error estimation
: For a large class of bounded-error estimation problems, the posterior feasible set 5 for the parameters can be dened by nonlinear inequalities. The set-inversion approach combine...
Luc Jaulin
TKDE
2002
133views more  TKDE 2002»
15 years 6 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
INFSOF
2008
85views more  INFSOF 2008»
15 years 6 months ago
Locating dependence structures using search-based slicing
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li
CCE
2010
15 years 4 months ago
A simple heuristic for reducing the number of scenarios in two-stage stochastic programming
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
Ramkumar Karuppiah, Mariano Martín, Ignacio...