287 search results - page 54 / 58 » An Algebraic Approach to Constraint Satisfaction Problems |
EC
2008
13 years 7 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
ILP
2007
Springer
14 years 1 months ago
2007
Springer
: This paper is concerned with relational Support Vector Machines, at the intersection of Support Vector Machines (SVM) and relational learning or Inductive Logic Programming (ILP)...
SAC
2003
ACM
14 years 26 days ago
2003
ACM
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...