3946 search results - page 383 / 790 » The computational complexity of choice sets |
210
click to vote
FMOODS
2003
15 years 9 months ago
2003
Performance analysis of computing systems, in particular distributed computing systems, is a complex process. Analysing the complex flows and interactions between a set of distribu...
268
Voted
SPATIALCOGNITION
2000
Springer
15 years 11 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
225
click to vote
APPROX
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
183
Voted
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
204
click to vote
ASIACRYPT
2009
Springer
16 years 2 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...