245 search results - page 12 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
110
click to vote
FLOPS
2008
Springer
15 years 1 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...
ICML
2008
IEEE
16 years 18 days ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
IJCAI
2003
15 years 1 months ago
2003
Information integration systems provide a uniform query interface to a set of sources. One of the key challenges for an information integration system is to provide maximally comp...
JMLR
2006
14 years 11 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
103
click to vote
DCG
2000
14 years 11 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...