920 search results - page 55 / 184 » Generating Satisfiable Problem Instances |
JAR
2006
13 years 10 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
TACAS
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. The Real-Time Calculus (RTC) [16] is a framework to analyze heterogeneous real-time systems that process event streams of data. The streams are characterized by pairs of ...
AGP
1999
IEEE
14 years 3 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
CRYPTO
1994
Springer
14 years 2 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...