718 search results - page 100 / 144 » Extraction of Structured Programs from Specification Proofs |
CP
2007
Springer
14 years 2 months ago
2007
Springer
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
BMCBI
2005
13 years 8 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
BMCBI
2005
13 years 8 months ago
2005
Background: Structure-dependent substitution matrices increase the accuracy of sequence alignments when the 3D structure of one sequence is known, and are successful e.g. in fold ...
SCL
2008
13 years 8 months ago
2008
Significant progress in control design has been achieved by the use of nonsmooth and semiinfinite mathematical programming techniques. In contrast with LMI or BMI approaches, thes...