920 search results - page 34 / 184 » Generating Satisfiable Problem Instances |
DAC
1996
ACM
14 years 2 months ago
1996
ACM
- The problem of stochastic sequential machines (SSM) synthesis is addressed and its relationship with the constrained sequence generation problem which arises during power estimat...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
ICNC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
COMPSAC
2003
IEEE
14 years 3 months ago
2003
IEEE
One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however,...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...