1941 search results - page 58 / 389 » On the Hardness of Approximate Reasoning |
119
click to vote
PROMISE
2010
14 years 6 months ago
2010
Background: There are many data mining methods but few comparisons between them. For example, there are at least two ways to build quality optimizers, programs that find project o...
124
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
109
click to vote
ISSTA
2009
ACM
15 years 6 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
103
click to vote
ESWS
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...