Sciweavers

1089 search results - page 179 / 218
» Bounds on generalized Frobenius numbers
Sort
View
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 10 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
ATAL
2010
Springer
13 years 10 months ago
Aggregating preferences in multi-issue domains by using maximum likelihood estimators
In this paper, we study a maximum likelihood estimation (MLE) approach to preference aggregation and voting when the set of alternatives has a multi-issue structure, and the voter...
Lirong Xia, Vincent Conitzer, Jérôme ...
ISCA
2011
IEEE
270views Hardware» more  ISCA 2011»
13 years 16 days ago
Sampling + DMR: practical and low-overhead permanent fault detection
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
Shuou Nomura, Matthew D. Sinclair, Chen-Han Ho, Ve...
ASPLOS
2011
ACM
13 years 13 days ago
Specifying and checking semantic atomicity for multithreaded programs
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
Jacob Burnim, George C. Necula, Koushik Sen
ACSC
2008
IEEE
14 years 3 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen