6274 search results - page 139 / 1255 » Proofs, Programs, Processes |
191
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...
176
click to vote
DISOPT
2008
15 years 6 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
158
click to vote
MP
2010
15 years 5 months ago
2010
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...
151
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
185
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...