738 search results - page 61 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Software agents help automate a variety of tasks including those involved in buying and selling products over the internet. The need for handling complex highly configurable produ...
BMCBI
2010
14 years 10 months ago
2010
Background: Polymerase chain reaction with confronting two-pair primers (PCR-CTPP) method produces allelespecific DNA bands of different lengths by adding four designed primers an...
STOC
1991
ACM
15 years 1 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
JMM2
2007
14 years 9 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
TABLEAUX
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...