673 search results - page 84 / 135 » Preference-Based Problem Solving for Constraint Programming |
TCS
2008
13 years 7 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
EPIA
1999
Springer
13 years 12 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
An articulated trajectory is defined as a trajectory that remains at a fixed distance with respect to a parent trajectory. In this paper, we present a method to reconstruct an a...
ANOR
2004
13 years 7 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...