Sciweavers

161 search results - page 28 / 33
» Lazy call-by-value evaluation
Sort
View
FLAIRS
2001
13 years 9 months ago
Skill Refinement through Competence Feedback
Learningis generally performedin twostages, knowledge acquisition and skill refinement. Developments within machinelearning havetended to concentrate on knowledgeacquisition as op...
David W. Patterson, Sarabjot S. Anand, John G. Hug...
JAIR
2008
120views more  JAIR 2008»
13 years 7 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 5 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
13 years 11 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
BMCBI
2006
129views more  BMCBI 2006»
13 years 7 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...