3238 search results - page 237 / 648 » On the Computational Interpretation of Negation |
201
click to vote
ML
2007
ACM
15 years 6 months ago
2007
ACM
Which active learning methods can we expect to yield good performance in learning binary and multi-category logistic regression classifiers? Addressing this question is a natural ...
165
click to vote
TAPSOFT
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
192
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
148
click to vote
KI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
173
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...