2168 search results - page 93 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
105
Voted
ACSAC
1999
IEEE
15 years 8 months ago
1999
IEEE
Secure enterprise programming is a difficult and tedious task. Programmers need tools that support t levels of abstraction and that track all the components that participate in di...
128
Voted
PPL
2006
15 years 3 months ago
2006
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
163
Voted
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
155
Voted
KR
2010
Springer
15 years 7 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
140
Voted
POS
1994
Springer
15 years 7 months ago
1994
Springer
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...