2233 search results - page 224 / 447 » On the Complexity of Theory Curbing |
159
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
163
click to vote
QSIC
2009
IEEE
16 years 1 months ago
2009
IEEE
—A well-founded testing theory encourages the practical application of test case generation techniques. This aims at overcoming the ever increasing complexity of softwareenabled ...
163
click to vote
ISMVL
2009
IEEE
16 years 1 months ago
2009
IEEE
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
194
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
151
click to vote
BPM
2009
Springer
16 years 1 months ago
2009
Springer
The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphic...