1615 search results - page 129 / 323 » Computer science and decision theory |
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
79
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial spa...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
104
click to vote
RELMICS
2000
Springer
15 years 4 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
118
click to vote
SPIN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...