2168 search results - page 105 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
151
click to vote
AAAI
2010
15 years 5 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
232
Voted
ASPLOS
2009
ACM
16 years 4 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
139
Voted
CCS
2008
ACM
15 years 5 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
135
Voted
FPGA
2009
ACM
15 years 10 months ago
2009
ACM
Many natural processes exhibit exponential decay and, consequently, computational scientists make extensive use of e−x in computer simulation experiments. While it is common to ...
IWCIA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Several authors have proposed algorithms for curve partitioning using the arc-chord distance formulation, where a chord whose associated arc spans k pixels is moved along...