6456 search results - page 317 / 1292 » Constraint Solving on Terms |
180
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
141
click to vote
ERSA
2006
15 years 8 months ago
2006
: A brief review of mapping generalized template matching operations onto reconfigurable computers is given. A combinatorial optimization process, where the objective is to minimiz...
150
click to vote
IJCAI
2003
15 years 8 months ago
2003
We solve the problem of obtaining answers to queries posed to a mediated integration system un der the local-as-view paradigm that are consistent wrt to certain global integrity...
157
click to vote
WSC
2001
15 years 8 months ago
2001
We review chessboard distributions for modeling partially specified finite-dimensional random vectors. Chessboard distributions can match a given set of marginals, a given covaria...
136
click to vote
COR
2006
15 years 6 months ago
2006
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...