920 search results - page 105 / 184 » Generating Satisfiable Problem Instances |
146
Voted
EUROCRYPT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We propose and realize a definition of security for passwordbased key exchange within the framework of universally composable (UC) security, thus providing security guar...
114
Voted
BIRTHDAY
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...
131
click to vote
AAMAS
2008
Springer
15 years 2 months ago
2008
Springer
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent/incomplete/uncertain knowledge, based on the construction and the comparison of ar...
152
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
131
click to vote
RSA
2008
15 years 2 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...