68 search results - page 12 / 14 » Realizability algebras: a program to well order R |
HICSS
2007
IEEE
15 years 4 months ago
2007
IEEE
The USCP had enormous challenges with its IT Program and support to the internal and external stakeholders of the Department, because of a fragile IT infrastructure. The IT Progra...
124
click to vote
DIMACS
1996
14 years 11 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
SP
2010
IEEE
15 years 1 months ago
2010
IEEE
In this work, we design a method for creating public key broadcast encryption systems. Our main technical innovation is based on a new “two equation” technique for revoking us...
SC
2009
ACM
15 years 4 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...