165 search results - page 11 / 33 » Type relaxed weaving |
TCC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
FLAIRS
2008
13 years 8 months ago
2008
This paper describes an algorithm developed as a decision support system for SMT line operators and its purpose is to suggest changes in an existing feeder setup in order to impro...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
MOBILITY
2009
ACM
14 years 11 days ago
2009
ACM
Many adaptative context-aware middleware exist and mostly rely on so-called vertical architectures that offer a functional decomposition for context-awareness. This architecture ...