182 search results - page 21 / 37 » Reformulation of Global Constraints in Answer Set Programmin... |
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
IPMI
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
4OR
2006
14 years 9 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
123
Voted
ASE
1998
14 years 9 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
83
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...