2989 search results - page 288 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
174
click to vote
WISE
2003
Springer
15 years 12 months ago
2003
Springer
At the heart of today’s information-explosion problems are issues involving semantics, mutual understanding, concept matching, and interoperability. Ontologies and the Semantic ...
191
click to vote
C3S2E
2010
ACM
15 years 7 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
215
click to vote
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
198
click to vote
SPLC
2010
15 years 5 months ago
2010
Product line engineering allows for the rapid development of variants of a domain specific application by using a common set of reusable assets often known as core assets. Variabil...
222
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Protein remote homology detection is a central problem in computational biology. Most recent methods train support vector machines to discriminate between related and ...