706 search results - page 31 / 142 » Super Solutions in Constraint Programming |
109
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account...
103
click to vote
HEURISTICS
2002
14 years 11 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
121
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
115
click to vote
CP
2004
Springer
15 years 5 months ago
2004
Springer
The contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR ...