3495 search results - page 110 / 699 » On the random satisfiable process |
86
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
103
click to vote
ASIACRYPT
2006
Springer
15 years 4 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
119
Voted
ACISP
2010
Springer
15 years 2 months ago
2010
Springer
We introduce the concept of attribute-based authenticated key exchange (AB-AKE) within the framework of ciphertext policy attribute-based systems. A notion of AKE-security for AB-A...
97
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
This paper is concerned with the problem of receding horizon control of discrete-time systems subject to possibly unbounded random noise inputs, while satisfying hard bounds on the...
101
click to vote
AUTOMATICA
2008
15 years 29 days ago
2008
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...