Sciweavers

251 search results - page 10 / 51
» Automated Complexity Analysis Based on the Dependency Pair M...
Sort
View
BMCBI
2006
86views more  BMCBI 2006»
14 years 9 months ago
MCALIGN2: Faster, accurate global pairwise alignment of non-coding DNA sequences based on explicit models of indel evolution
Background: Non-coding DNA sequences comprise a very large proportion of the total genomic content of mammals, most other vertebrates, many invertebrates, and most plants. Unravel...
Jun Wang, Peter D. Keightley, Toby Johnson
FMCO
2009
Springer
134views Formal Methods» more  FMCO 2009»
14 years 7 months ago
Verification of Context-Dependent Channel-Based Service Models
Abstract. The paradigms of service-oriented computing and modeldriven development are becoming of increasing importance in the field of software engineering. According to these par...
Natallia Kokash, Christian Krause, Erik P. de Vink
RR
2010
Springer
14 years 8 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
DEXA
2006
Springer
171views Database» more  DEXA 2006»
14 years 11 months ago
Automating the Choice of Decision Support System Architecture
Abstract. Due to the wide-spread use of decision support systems (DSS), methods are required by software companies. Several concepts and methods have been suggested for decision-ma...
Estella Annoni, Franck Ravat, Olivier Teste, Gille...
CORR
2006
Springer
95views Education» more  CORR 2006»
14 years 9 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...